Adaptive Dynamic Process Scheduling on Distributed Memory Parallel Computers
نویسندگان
چکیده
منابع مشابه
Adaptive Dynamic Process Scheduling on Distributed Memory Parallel Computers
| One of the challenges in programming distributed memory parallel machines is deciding how to allocate work to processors. This problem is particularly important for computations with unpredictable dynamic behaviors or irregular structures. We present a scheme for dynamic scheduling of medium-grained processes that is useful in this context. The Adaptive Contracting Within Neighborhood (ACWN) ...
متن کاملRuntime Incremental Parallel Scheduling (RIPS) on Distributed Memory Computers
| Runtime Incremental Parallel Scheduling (RIPS) is an alternative strategy to the commonly used dynamic scheduling. In this scheduling strategy, the system scheduling activity alternates with the underlying computation work. RIPS utilizes the advanced parallel scheduling technique to produce a low-overhead, high-quality load balancing, as well as adapting to irregular applications. This paper ...
متن کاملRuntime Incremental Parallel Scheduling on Distributed Memory Computers
| Runtime Incremental Parallel Scheduling (RIPS) is an alternative strategy to the commonly used dynamic scheduling. In this scheduling strategy, the system scheduling activity alternates with the underlying computation work. RIPS utilizes advanced parallel scheduling techniques to produce a low-overhead, high-quality load balancing and adapts to applications of nonuniform structures.
متن کاملRuntime Incremental Parallel Scheduling (RIPS) on Distributed Memory Computers - Parallel and Distributed Systems, IEEE Transactions on
Runtime Incremental Parallel Scheduling (RIPS) is an alternative strategy to the commonly used dynamic scheduling. In this scheduling strategy, the system scheduling activity alternates with the underlying computation work. RIPS utilizes the advanced parallel scheduling technique to produce a low-overhead, high-quality load balancing, as well as adapting to irregular applications. This paper pr...
متن کاملOn Parallel Retrievals Using Distributed Memory Computers
This paper introduces an eecient indexing organization which provides for parallel retrievals. Given a p-processor massively parallel computer, our organization allows a maximum of p retrievals to be performed concurrently and thus achieves an approximate speed up of p in the best case. The index structure is based on the multi-B-tree index structure. It is compatible with current automatic ret...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Programming
سال: 1994
ISSN: 1058-9244,1875-919X
DOI: 10.1155/1994/856294