Sciweavers

1663 search results - page 209 / 333
» Scheduling techniques for media-on-demand
Sort
View
STACS
2004
Springer
15 years 6 months ago
On Minimum Circular Arrangement
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
Murali K. Ganapathy, Sachin Lodha
CODES
2003
IEEE
15 years 6 months ago
Design optimization of mixed time/event-triggered distributed embedded systems
Distributed embedded systems implemented with mixed, eventtriggered and time-triggered task sets, which communicate over bus protocols consisting of both static and dynamic phases...
Traian Pop, Petru Eles, Zebo Peng
IPPS
2003
IEEE
15 years 6 months ago
Dynamic Mapping in a Heterogeneous Environment with Tasks Having Priorities and Multiple Deadlines
In a distributed heterogeneous computing system, the resources have different capabilities and tasks have different requirements. To maximize the performance of the system, it is ...
Jong-Kook Kim, Sameer Shivle, Howard Jay Siegel, A...
82
Voted
DATE
2010
IEEE
139views Hardware» more  DATE 2010»
15 years 5 months ago
Constant-time admission control for Deadline Monotonic tasks
—The admission control problem is concerned with determining whether a new task may be accepted by a system consisting of a set of running tasks, such that the already admitted a...
Alejandro Masrur, Samarjit Chakraborty, Georg F&au...
SPAA
2009
ACM
15 years 5 months ago
Brief announcement: a lower bound for depth-restricted work stealing
Work stealing is a common technique used in the runtime schedulers of parallel languages such as Cilk and parallel libraries such as Intel Threading Building Blocks (TBB). Depth-r...
Jim Sukha