Sciweavers

720 search results - page 43 / 144
» Broadcast scheduling: algorithms and complexity
Sort
View
OPODIS
2007
15 years 7 months ago
Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks
This report describes a necessary and sufficient test for the schedulability of a set of sporadic harddeadline tasks on a multiprocessor platform, using any of a variety of schedu...
Theodore P. Baker, Michele Cirinei
DATE
1997
IEEE
89views Hardware» more  DATE 1997»
15 years 10 months ago
Cone-based clustering heuristic for list-scheduling algorithms
List scheduling algorithms attempt to minimize latency under resource constraints using a priority list. We propose a new heuristic that can be used in conjunction with any priori...
Sriram Govindarajan, Ranga Vemuri
TCOM
2008
74views more  TCOM 2008»
15 years 6 months ago
Stability of a frame-based oldest-cell-first maximal weight matching algorithm
Abstract-- Input-queued cell switches employing the oldestcell-first (OCF) policy have been shown to yield low mean delay characteristics. Moreover, it has been proven that OCF is ...
Xike Li, Itamar Elhanany
SP
2010
IEEE
156views Security Privacy» more  SP 2010»
15 years 4 months ago
Round-Efficient Broadcast Authentication Protocols for Fixed Topology Classes
Abstract--We consider resource-constrained broadcast authentication for n receivers in a static, known network topology. There are only two known broadcast authentication protocols...
Haowen Chan, Adrian Perrig
ECRTS
1999
IEEE
15 years 10 months ago
Scheduling coprocessor for enhanced least-laxity-first scheduling in hard real-time systems
Scheduling time impact on system performance increases especially when using dynamic priority algorithms, because of the enlarged computational effort at runtime. This overhead ca...
Jens Hildebrandt, Frank Golatowski, Dirk Timmerman...