Sciweavers

279 search results - page 11 / 56
» Low Overhead Parallel Schedules for Task Graphs
Sort
View
DSN
2000
IEEE
14 years 4 days ago
Fault-Secure Scheduling of Arbitrary Task Graphs to Multiprocessor Systems
In this paper, we propose new scheduling algorithms to achieve fault security in multiprocessor systems. We consider scheduling of parallel programs represented by directed acycli...
Koji Hashimoto, Tatsuhiro Tsuchiya, Tohru Kikuno
CLUSTER
2006
IEEE
13 years 7 months ago
A taxonomy of application scheduling tools for high performance cluster computing
Application scheduling plays an important role in high-performance cluster computing. Application scheduling can be classified as job scheduling and task scheduling. This paper pre...
Jiannong Cao, Alvin T. S. Chan, Yudong Sun, Sajal ...
MST
2000
57views more  MST 2000»
13 years 7 months ago
On Scheduling Parallel Tasks at Twilight
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
Hannah Bast
ICPP
1999
IEEE
14 years 7 hour ago
FLB: Fast Load Balancing for Distributed-Memory Machines
This paper describes a novel compile-time list-based task scheduling algorithm for distributed-memory systems, called Fast Load Balancing (FLB). Compared to other typical list sch...
Andrei Radulescu, Arjan J. C. van Gemund
ICPP
2002
IEEE
14 years 20 days ago
Power Aware Scheduling for AND/OR Graphs in Multi-Processor Real-Time Systems
Power aware computing has become popular recently and many techniques have been proposed to manage the energy consumption for traditional real-time applications. We have previousl...
Dakai Zhu, Nevine AbouGhazaleh, Daniel Mossé...