19 search results - page 1 / 4 » Applying Scheduling by Edge Reversal to Constraint Partition... |
SBACPAD
2003
IEEE
13 years 10 months ago
2003
IEEE
— Scheduling by Edge Reversal (SER) is a fully distributed scheduling mechanism based on the manipulation of acyclic orientations of a graph. This work uses SER to perform constr...
RSP
1998
IEEE
13 years 9 months ago
1998
IEEE
One of the major differences in partitioning for codesign is in the way the communication cost is evaluated. Generally the size of the edge cut-set is used. When communication bet...
RTSS
2006
IEEE
13 years 10 months ago
2006
IEEE
We present a real-time, Linux-based testbed called LITMUSRT , which we have developed for empirically evaluating multiprocessor real-time scheduling algorithms. We also present th...
DATE
2003
IEEE
13 years 10 months ago
2003
IEEE
We present a high-level synthesis algorithm solving the combined scheduling, allocation and binding problem minimizing area under both latency and maximum power per clock-cycle co...
TPDS
2008
13 years 4 months ago
2008
Hierarchical scheduling has been proposed as a scheduling technique to achieve aggregate resource partitioning among related groups of threads and applications in uniprocessor and...