46 search results - page 6 / 10 » Fault-Secure Scheduling of Arbitrary Task Graphs to Multipro... |
CLUSTER
2006
IEEE
13 years 7 months ago
2006
IEEE
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...
PRDC
2006
IEEE
14 years 1 months ago
2006
IEEE
This paper presents the performance analysis of several well-known partitioning scheduling algorithms in real-time and fault-tolerant multiprocessor systems. Both static and dynam...
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
ESTIMEDIA
2007
Springer
14 years 1 months ago
2007
Springer
Today’s embedded applications often consist of multiple concurrent tasks. These tasks are decomposed into subtasks which are in turn assigned and scheduled on multiple different...
ECRTS
2008
IEEE
14 years 2 months ago
2008
IEEE
T-N Plane Abstraction (E-TNPA) proposed in this paper realizes work-conserving and efficient optimal real-time scheduling on multiprocessors relative to the original T-N Plane Ab...