IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Parallel Computing - Heterogeneous computing
A Heuristic Scheduling Strategy for Independent Tasks on Grid
HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
Task assignment in heterogeneous computing systems
Journal of Parallel and Distributed Computing
New grid scheduling and rescheduling methods in the GrADS project
International Journal of Parallel Programming - Special issue: The next generation software program
A multi-dimensional scheduling scheme in a Grid computing environment
Journal of Parallel and Distributed Computing
Adaptive Allocation of Independent Tasks to Maximize Throughput
IEEE Transactions on Parallel and Distributed Systems
Dynamic, capability-driven scheduling of DAG-based real-time jobs in heterogeneous clusters
International Journal of High Performance Computing and Networking
Mapping pipeline skeletons onto heterogeneous platforms
Journal of Parallel and Distributed Computing
Journal of Systems Architecture: the EUROMICRO Journal
A Novel Algorithm Applied to Task Scheduling in Grid Computing
International Journal of Distributed Sensor Networks
Multi-Criteria Scheduling of Pipeline Workflows (and Application To the JPEG Encoder)
International Journal of High Performance Computing Applications
Mapping filtering streaming applications with communication costs
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
BSB'07 Proceedings of the 2nd Brazilian conference on Advances in bioinformatics and computational biology
Computing the throughput of probabilistic and replicated streaming applications
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
SmartNetSolve: high-level programming system for high performance grid computing
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Topology-aware task mapping for reducing communication contention on large parallel machines
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
A simple scheduling heuristic for heterogeneous computing environments
ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing
International Journal of High Performance Computing Applications
Multifaceted web services: an approach to secure and scalable grid scheduling
EuroWeb'02 Proceedings of the 2002 international conference on EuroWeb
An Adaptive Scoring Job Scheduling algorithm for grid computing
Information Sciences: an International Journal
Enabling efficient placement of virtual infrastructures in the cloud
Proceedings of the 13th International Middleware Conference
A survey of pipelined workflow scheduling: Models and algorithms
ACM Computing Surveys (CSUR)
Hi-index | 0.00 |
A heuristic algorithm that maps data-processing tasks onto heterogeneous resources (i.e., processors and links of various capacities) is presented. The algorithm tries to achieve a good throughput of the whole data-processing pipeline, taking both parallelism (load balance) and communication volume (locality) into account. It performs well both under compute-intensive and communication-intensive conditions. When all tasks/processors are of the same size and communication is negligible, it quickly distributes the compute load over processors and finds the optimal mapping. As communication becomes significant and reveals as a bottleneck, it trades parallelism for reduction of communication traffic. Experimental results using a topology generator that models the Internet show that it performs significantly better than communication-ignorant schedulers.