Scheduling precedence graphs in systems with interprocessor communication times
SIAM Journal on Computing
Multiprocessor system for realtime robotics applications
Microprocessors & Microsystems
A comparison of list schedules for parallel processing systems
Communications of the ACM
Operating Systems Theory
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
Models of machines and computation for mapping in multicomputers
ACM Computing Surveys (CSUR)
Estimating architectural resources and performance for high-level synthesis applications
DAC '93 Proceedings of the 30th international Design Automation Conference
A Scalable Scheduling Scheme for Functional Parallelism on Distributed Memory Multiprocessor Systems
IEEE Transactions on Parallel and Distributed Systems
Scheduling optimization through iterative refinement
PACT '95 Proceedings of the IFIP WG10.3 working conference on Parallel architectures and compilation techniques
IEEE Transactions on Parallel and Distributed Systems
Exploiting heterogeneous parallelism in the presence of communication delays
ICS '98 Proceedings of the 12th international conference on Supercomputing
On Exploiting Task Duplication in Parallel Program Scheduling
IEEE Transactions on Parallel and Distributed Systems
A recursive time estimation algorithm for program traces under resource constraints
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Booking heterogeneous processor resources to reduce communication overhead
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Static scheduling algorithms for allocating directed task graphs to multiprocessors
ACM Computing Surveys (CSUR)
SOS: synthesis of application-specific heterogeneous multiprocessor systems
Readings in hardware/software co-design
Analysis of Macro-Dataflow Dynamic Scheduling on Nonuniform Memory Access Architectures
IEEE Transactions on Parallel and Distributed Systems
DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors
IEEE Transactions on Parallel and Distributed Systems
HiPC '01 Proceedings of the 8th International Conference on High Performance Computing
A fast task-to-processor assignment heuristic for real-time multiprocessor DSP applications
Computers and Operations Research
Energy reduction techniques for multimedia applications with tolerance to deadline misses
Proceedings of the 40th annual Design Automation Conference
Benchmarking the Task Graph Scheduling Algorithms
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
An Incremental Genetic Algorithm Approach to Multiprocessor Scheduling
IEEE Transactions on Parallel and Distributed Systems
A probabilistic scheduling heuristic for computational grids
Multiagent and Grid Systems
Probabilistic design of multimedia embedded systems
ACM Transactions on Embedded Computing Systems (TECS)
An Evolutionary Approach to Task Graph Scheduling
ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I
Contributions to the multiprocessor scheduling problem
CI '07 Proceedings of the Third IASTED International Conference on Computational Intelligence
A bipartite genetic algorithm for multi-processor task scheduling
International Journal of Parallel Programming
Scheduling for heterogeneous Systems using constrained critical paths
Parallel Computing
Resource Minimization for Real-Time Applications Using Computer Clouds
UCC '13 Proceedings of the 2013 IEEE/ACM 6th International Conference on Utility and Cloud Computing
| Hi-index | 0.00 |
A lower bound on the number of processors and finish time for the problem of scheduling precedence graphs with communication costs is presented. The notion of the earliest starting time of a task is formulated for the context of lower bounds. A lower bound on the completion time is proposed. A task delay which does not increase the earliest completion time of a schedule is defined. Each task can then be scheduled within a time interval without affecting the lower bound performance on the finish time. This leads to definition of a new lower bound on the number of processors required to process the task graph. A derivation of the minimum time increase over the earliest completion time is also proposed for the case of a smaller number of processors. A lower bound on the minimum number of interprocessor communication links required to achieve optimum performance is proposed. Evaluation had been carried out by using a set of 360 small graphs. The bound on the finish time deviates at most by 5% from the optimum solution in 96% of the cases and performs well with respect to the minimum number of processors and communication links.