Paper Info
Title
A Scheduling Algorithm With Static Partition For Total Exchange
Abstract
The GRID environment is a parallel or distributed system which utilizes geographically distributed computational resources, and has been receiving considerable attention over recent years. On the GRID environment, efficient scheduling algorithms for basic communication operations are important to improve total computational performance. In this paper, we consider improvement of scheduling algorithms for the total exchange, which is a basic communication pattern used on the GRID environment. We first prove that there exists an input which is hard to be scheduled without partition of communication events. We next propose a scheduling algorithm which consists of static partitions of the communication events. Finally, we compare performances between the proposed algorithm and other known algorithms for the total exchange using SimGrid. The experimental results show that our algorithm achieves performance improvements in comparison with previous algorithms for the input.
Year
Venue
Keywords
2005
PDPTA '05: PROCEEDINGS OF THE 2005 INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS 1-3
total exchange, GRID, scheduling algorithms
Field
DocType
Citations 
Fair-share scheduling,Scheduling (computing),Computer science,Parallel computing,Rate-monotonic scheduling,Partition (number theory),Dynamic priority scheduling,Round-robin scheduling,Proportionally fair,Grid,Distributed computing
Conference
0
PageRank 
References 
Authors
0.34
5
2
Name
Order
Citations
PageRank
Kenta Nakahira100.34
Akihiro Fujiwara212227.25