Optimal static load balancing in distributed computer systems
Journal of the ACM (JACM)
Modeling of Concurrent Task Execution in a Distributed System for Real-Time Control
IEEE Transactions on Computers
Task Allocation and Precedence Relations for Distributed Real-Time Systems
IEEE Transactions on Computers
Heuristic Algorithms for Task Assignment in Distributed Systems
IEEE Transactions on Computers
Distributed Scheduling of Tasks with Deadlines and Resource Requirements
IEEE Transactions on Computers
Load Sharing in Distributed Real-Time Systems with State-Change Broadcasts
IEEE Transactions on Computers
Allocating Modules to Processors in a Distributed System
IEEE Transactions on Software Engineering
Responsive, deterministic IEEE 802.5 token ring scheduling
Real-Time Systems
Module Allocation of Real-Time Applications to Distributed Systems
IEEE Transactions on Software Engineering
On the Assignment Problem of Arbitrary Process Systems to Heterogeneous Distributed Computer Systems
IEEE Transactions on Computers
Proceedings of the 1992 ACM annual conference on Communications
CSC '92 ACM 20th Annual Computer Science Conference
Task Allocation for Maximizing Reliability of Distributed Computer Systems
IEEE Transactions on Computers
Issues in the static allocation and scheduling of complex periodic tasks
RTOSS '93 Proceedings of the tenth IEEE workshop on Real-time operating systems and software
Task allocation and redistribution in distributed real-time systems
Task allocation and redistribution in distributed real-time systems
On Slot Allocation for Time-Constrained Messages in Dual-Bus Networks
IEEE Transactions on Computers
Synchronous Bandwidth Allocation for Real-Time Communications with the Timed-Token MAC Protocol
IEEE Transactions on Computers
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Guaranteeing Synchronous Message Deadlines with the Timed Token Medium Access Control Protocol
IEEE Transactions on Computers
IEEE Transactions on Computers
Analytic Models of Adaptive Load Sharing Schemes in Distributed Real-Time Systems
IEEE Transactions on Parallel and Distributed Systems
A polynomial-time optimal synchronous bandwidth allocation scheme for the timed-token MAC protocol
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2
Multiprocessor Scheduling with the Aid of Network Flow Algorithms
IEEE Transactions on Software Engineering
A probabilistic performance metric for real-time system design
CODES '99 Proceedings of the seventh international workshop on Hardware/software codesign
Proceedings of the ninth international symposium on Hardware/software codesign
Estimating probabilistic timing performance for real-time embedded systems
IEEE Transactions on Very Large Scale Integration (VLSI) Systems - System Level Design
Load Sharing in Distributed Multimedia-on-Demand Systems
IEEE Transactions on Knowledge and Data Engineering
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
A Stochastic Framework for Co-synthesis of Real-Time Systems
LCTES '00 Proceedings of the ACM SIGPLAN Workshop on Languages, Compilers, and Tools for Embedded Systems
An Evolutionary Scheme for Cosynthesis of Real-Time Systems
ASP-DAC '02 Proceedings of the 2002 Asia and South Pacific Design Automation Conference
Communication-Aware Task Scheduling and Voltage Selection for Total Systems Energy Minimization
Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
Real Time Scheduling Theory: A Historical Perspective
Real-Time Systems
Branch-and-bound task allocation with task clustering-based pruning
Journal of Parallel and Distributed Computing
Efficient Assignment and Scheduling for Heterogeneous DSP Systems
IEEE Transactions on Parallel and Distributed Systems
On multiprocessor task scheduling using efficient state space search approaches
Journal of Parallel and Distributed Computing
Improving security for periodic tasks in embedded systems through scheduling
ACM Transactions on Embedded Computing Systems (TECS)
Cost minimization while satisfying hard/soft timing constraints for heterogeneous embedded systems
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Component assignment for large distributed embedded software development
GPC'07 Proceedings of the 2nd international conference on Advances in grid and pervasive computing
EUC'07 Proceedings of the 2007 international conference on Embedded and ubiquitous computing
An open computing resource management framework for real-time computing
HiPC'08 Proceedings of the 15th international conference on High performance computing
Optimizing resource usage in component-based real-time systems
CBSE'05 Proceedings of the 8th international conference on Component-Based Software Engineering
A systematic approach to classify design-time global scheduling techniques
ACM Computing Surveys (CSUR)
A Hierarchical Framework for Organizing a Software Development Process
Operations Research
Utility accrual object distribution in MPSoC real-time embedded systems
Journal of Computer and System Sciences
Hi-index | 14.98 |
This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and timing constraints. Using the branch-and-bound technique, a module allocation scheme is proposed to find an "optimal" allocation that maximizes the probability of meeting task deadlines.The task system within a planning cycle is first modeled with a task flow graph which describes computation and communication modules, as well as the precedence constraints among them. To incorporate both timing and logical correctness into module allocation, the probability of meeting task deadlines is used as the objective function. The module allocation scheme is then applied to find an optimal allocation of task modules in a distributed system. The timing aspects embedded in the objective function drive the scheme not only to assign task modules to processing nodes, but also to use a module scheduling algorithm (with polynomial time complexity) for scheduling all modules assigned to each node, so that all tasks may be completed in time.In order to speed up the branch-and-bound process and to reduce the computational complexity, a dominance relation is derived from the requirement of timely completion of tasks and use to eliminate the possibility of generating vertices in the state-space search tree, which never lead to an optimal solution, and an upper bound of the objective function is derived for every partial allocation with which the scheme determines whether or not to prune the corresponding intermediate vertex in the search tree. Several numerical examples are presented to demonstrate the effectiveness and practicality of the proposed scheme.