2355 search results - page 156 / 471 » Scheduling in the Z-Polyhedral Model |
155
click to vote
ISCAS
2006
IEEE
16 years 18 hour ago
2006
IEEE
In recent times, much attention has been devoted to power optimization for real-time systems, while guaranteeing that such systems meet their hard (or soft) scheduling deadlines. ...
172
click to vote
PPOPP
2006
ACM
15 years 12 months ago
2006
ACM
Recently, the high-performance computing community has realized that power is a performance-limiting factor. One reason for this is that supercomputing centers have limited power ...
155
click to vote
RTAS
2002
IEEE
15 years 11 months ago
2002
IEEE
Real-time scheduling theory has developed powerful tools for translating conditions on aggregate system utilization into per-task schedulability guarantees. The main breakthrough ...
170
click to vote
INFOCOM
2008
IEEE
16 years 12 days ago
2008
IEEE
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
153
click to vote
INFOCOM
2005
IEEE
15 years 11 months ago
2005
IEEE
— We consider the problem of scheduling a sequence of packets over a linear network, where every packet has a source and a target, as well as a release time and a deadline by whi...