TAILIEUCHUNG - Linear switching state space (LS3) model for task scheduling: An analytical approach

In this study, first we show the role of nonlinear state space equations in modeling the standard TS, a suitable transformation is then devised to convert this model to linear switching state space (LS3) equations with nonlinear constraints, and then the most important aspects of a control-based system – the stability, controllability, observability and stabilizability – for the proposed method is analytically proven. | International Journal of Computer Networks and Communications Security C VOL. 1, NO. 4, SEPTEMBER 2013, 119–131 Available online at: ISSN 2308-9830 N C S Linear Switching State Space (LS3) Model for Task Scheduling: An Analytical Approach H. Tabatabaee1, and N. Pariz3 1 Department of Computer Engineering, Islamic Azad University, Quchan Branch, Quchan, Iran 2 Center of Excellence on Soft Computing and Intelligent Information Processing, 23 Dept. of Electrical Engineering, Ferdowsi University of Mashhad, Mashhad, Iran E-mail: ABSTRACT Task Scheduling (TS) poses a challenging problem in distributed systems such as multiprocessor systems, flow-shop scheduling, and project management problems in which there are multiple tasks and processors (resources), and the problem is to efficiently assign tasks to processors. The importance of this problem includes several aspects such as heterogeneity of processors, computational complexity of reaching a solution as well as theoretical performance analysis. In this paper, control theory is used to construct a modeling paradigm. The approach which is basically a switching state space model opens a possibility of using the extensive theoretical developments that have taken place in this field within the past several decades. In this study, first we show the role of nonlinear state space equations in modeling the standard TS, a suitable transformation is then devised to convert this model to linear switching state space (LS3) equations with nonlinear constraints, and then the most important aspects of a control-based system – the stability, controllability, observability and stabilizability – for the proposed method is analytically proven. Finally we inspected the robustness of the proposed model in a similar way at the presence of the changes in processing power and link failure. Keywords: Task Scheduling, Distributed Systems, Linear Switching State Space .

• Cơ khí - Chế tạo máy
• International Journal of Computer Networks and Communications
• Linear switching state space (LS3) model for task scheduling
• An analytical approach
• The proposed method
• Flow shop scheduling
• International Journal of Computer Networks and Communications Security
• Performance evaluation of manet protocols in communications
• Management of robots in simulation modelling
• Manet protocols in communications
• End To End Delay
• Show network optimization rate including PDR
• Deployment of voip communications in B&A spy agency
• Design and implementation
• Voip communications in B&A spy agency
• VoIP simulated in OPNET
• Proposed architecture and protocol stack for improving QoS
• Wide vehicular communications
• Vehicle to Vehicle
• Proposing minimum performance of proposed topology
• Plateau State University
• Computer networks and Communications Security
• Increasing the lifetime of wireless sensor networks
• Selforganizing map algorithm
• Wireless sensor networks
• Self organizing map neural networks
• Cloud computing architecture
• Wireless sensor networks for agricultural applications
• Wireless sensor actor networks
• Adaptive scheme for outliers detection in wireless sensor networks
• The Quality of Service
• Given sensor networks
• Mitigating the effect of malicious node
• Mobile ad hoc networks using trust
• Explicit no technique
• Mobile Ad Hoc Networks
• Consuming network resources
• Role of WAN optimization solutions in overcoming limitations
• TCP performance in Ad Hoc Networks
• Ad Hoc Networks
• WAN optimization technologies
• Potential applications of linear wireless sensor networks
• Linear wireless sensor networks
• LWSN in various applications
• LWSN in network topology
• Time dependent finite state machine
• Method for intrusion detection in mobile ad hoc networks
• Malicious behavior in AODV
• Performance analysis of multimedia traffic
• MPLS communication networks with traffic engineering
• MPLS communication networks
• Conventional IP network
• Inter cluster communication in wireless sensor networks
• Inter cluster communication
• Carrying out efficient diffusion
• Cluster merging and cluster diffusion
• An optimized model for transition from Ipv4 to Ipv6 networks
• Cloud computing environment
• Ipv4 to Ipv6 networks
• Identical traffic and network loads
• The optical communications
• Simulating an optical high debit transmission chain
• Optisystem with comparison of optical windows
• Comparison of optical windows
• Securing the sip communications with XML security mechanisms
• VoIP application awareness
• Question of confidentiality and integrity
• Client authentication and data confidentiality
• New unicast routing algorithm for load balancing
• Multigateway wireless mesh networks
• Negative percent algorithms
• Wireless mesh networks
• Detection of service attack
• Defense against distributed denial of service attack
• Packet filtration in wireless sensor networks
• Centralized identification system of subscribers with mobile networks
• The case of senegal
• Centralized identification integrating advanced technologies
• The best regulation of subscribers
• Wireless networks in hospitals
• A framework of use and implementation for nursing care
• Implementation for nursing care
• Appropriate framework for future efforts
• The signaling analysis of SIP based terminal mobility management
• SIP based terminal mobility management
• IEEE 802
• 11 and 802
• 16 heterogeneous networks
• Wireless local area network
• 16 based wireless metropolitan
• New banking interface system
• Wireless networks in referral customers
• The bank to increase customer satisfaction
• Efficient scheduling in cloud networks
• Chakoos evolutionary algorithm
• DSC and MCP algorithms
• The graphs involving communication cost
• A new approach for beaconless geographical routing
• Beaconless geographical routing
• Appropriate delay function independently
• Coverage aware battery regression curve node scheduling
• Longer network coverage lifetime
• RBSP and PEAS