628 search results - page 23 / 126 » Scheduling Algorithm with Potential Behaviors |
DAC
2000
ACM
14 years 10 months ago
2000
ACM
eously demand shorter and less costly design cycles. Designing at higher levels of abstraction makes both objectives achievable, but enabling techniques like behavioral synthesis h...
EOR
2006
13 years 9 months ago
2006
The subject of this paper is the formulation and solution of a variation of the classical binary knapsack problem. The variation that is addressed is termed the ``fixed-charge kna...
SASO
2008
IEEE
14 years 3 months ago
2008
IEEE
In this paper we study desynchronization, a closelyrelated primitive to graph coloring. A valid graph coloring is an assignment of colors to nodes such that no node’s color is t...
RTSS
2007
IEEE
14 years 3 months ago
2007
IEEE
We consider the issue of deadline tardiness under global multiprocessor scheduling algorithms. We present a general tardiness-bound derivation that is applicable to a wide variety...
CN
2011
13 years 4 months ago
2011
—In this paper, we study the interactions of user-based congestion control algorithms and router-based switch scheduling algorithms. We show that switch scheduling algorithms tha...