1609 search results - page 140 / 322 » A Microeconomic Scheduler for Parallel Computers |
168
click to vote
IPPS
2005
IEEE
16 years 2 days ago
2005
IEEE
We develop a message scheduling scheme that can theoretically achieve the maximum throughput for all–to–all personalized communication (AAPC) on any given Ethernet switched cl...
198
click to vote
IPPS
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper we present an adaptation of the Dual Priority Scheduling Algorithm to schedule both hard realtime periodic tasks and soft-aperiodic tasks in shared memory multiproce...
160
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper presents a new algorithm called List-based Load Balancing (LLB) for compile-time task scheduling on distributed-memory machines. LLB is intended as a cluster-mapping an...
162
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
This work deals with the scheduling problem of a directed acyclic graph with interprocessor communication delays. The objective is to minimize the makespan, taking into account the...
155
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
The scheduling of application tasks is a problem that occurs in all multiprocessor systems. This problem becomes even more complicated if the tasks are not independent but are inte...