Allocating Modules to Processors in a Distributed System
IEEE Transactions on Software Engineering
A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks
IEEE Transactions on Parallel and Distributed Systems
Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
Parallel Genetic Simulated Annealing: A Massively Parallel SIMD Algorithm
IEEE Transactions on Parallel and Distributed Systems
The grid: blueprint for a new computing infrastructure
The grid: blueprint for a new computing infrastructure
Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
Journal of the ACM (JACM)
Application-level scheduling on distributed heterogeneous networks
Supercomputing '96 Proceedings of the 1996 ACM/IEEE conference on Supercomputing
Tabu Search
Interconnection Networks: An Engineering Approach
Interconnection Networks: An Engineering Approach
TNet: A Reliable System Area Network
IEEE Micro
Spider: A High-Speed Network Interconnect
IEEE Micro
Scheduling Resources in Multi-User, Heterogeneous, Computing Environments with SmartNet
HCW '98 Proceedings of the Seventh Heterogeneous Computing Workshop
HCW '98 Proceedings of the Seventh Heterogeneous Computing Workshop
Dynamic Matching and Scheduling of a Class of Independent Tasks onto Heterogeneous Computing Systems
HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
Task Scheduling Algorithms for Heterogeneous Processors
HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
Scheduling From the Perspective of the Application
HPDC '96 Proceedings of the 5th IEEE International Symposium on High Performance Distributed Computing
On the development of a communication-aware task mapping technique
Journal of Systems Architecture: the EUROMICRO Journal
Multifaceted web services: an approach to secure and scalable grid scheduling
EuroWeb'02 Proceedings of the 2002 international conference on EuroWeb
| Hi-index | 0.00 |
Many research activities have focused on the problem of task scheduling in heterogeneous systems from the computational point of view. However, an ideal scheduling strategy would also take into account the communication requirements of the applications and the communication bandwidth that the network can offer. In this paper, we first propose a criterion to measure the suitability of each allocation of network resources to each parallel application, according to the communication requirements. Second, we propose a scheduling technique based exclusively on a criterion that provides a near-optimal mapping of processes to processors according to the communication requirements. Evaluation results show that the use of this scheduling technique fully exploits the available network bandwidth, greatly improving network performance. Therefore, the proposed scheduling technique may be used in the design of communication-aware scheduling strategies for those situations where the communication requirements are the system performance bottleneck.