182 search results - page 10 / 37 » Benchmarking the Task Graph Scheduling Algorithms |
EMSOFT
2011
Springer
13 years 9 months ago
2011
Springer
Most of the hard-real-time scheduling theory for multiprocessor systems assumes independent periodic or sporadic tasks. Such a simple task model is not directly applicable to mode...
133
click to vote
INFOCOM
2011
IEEE
14 years 1 months ago
2011
IEEE
—For energy conservation, a wireless sensor network is usually designed to work in a low-duty-cycle mode, in which a sensor node keeps active for a small percentage of time durin...
IEEEPACT
2002
IEEE
15 years 2 months ago
2002
IEEE
This paper presents a new modulo scheduling algorithm for clustered microarchitectures. The main feature of the proposed scheme is that the assignment of instructions to clusters ...
ICPP
1994
IEEE
15 years 1 months ago
1994
IEEE
1 In this paper, we explore the problem of scheduling parallel programs using task duplication for messagepassing multicomputers. Task duplication means scheduling a parallel progr...
CC
2009
Springer
15 years 2 months ago
2009
Springer
Single-assignment languages with copy semantics have a very simple and approachable programming model. A na¨ıve implementation of the copy semantics that copies the result of eve...