Amortized efficiency of list update and paging rules
Communications of the ACM
Efficient techniques for fast nested barrier synchronization
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Efficient techniques for nested and disjoint barrier synchronization
Journal of Parallel and Distributed Computing - Special issue on compilation and architectural support for parallel applications
Parallel Job Scheduling: Issues and Approaches
IPPS '95 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Improved Utilization and Responsiveness with Gang Scheduling
IPPS '97 Proceedings of the Job Scheduling Strategies for Parallel Processing
Solving irregularly structured problems based on distributed object model
Parallel Computing - Special issue: Parallel and distributed scientific and engineering computing
| Hi-index | 0.00 |
We consider the problem of efficiently executing completely irregular, communication-intensive parallel programs. Completely irregular programs are those whose number of parallel threads as well as the amount of computation performed in each thread vary during execution. Our programs run on MIMD computers with some form of space-slicing (partitioning) and time-slicing (scheduling) support. A hardware barrier sync hronization mechanism is required to efficiently implement the frequent communications of our programs, and this constrains the computer to a fixed size partitioning policy.We compare the possible scheduling policies for irregular programs on fixed size partitions: local scheduling and multi-gangscheduling, and prove that local scheduling does better. Then we introduce competitive analysis and formally analyze the online rebalancing algorithms required for efficient local sc heduling under two scenarios: with full information and with partial information.