3934 search results - page 54 / 787 » Approximate Schedulability Analysis |
143
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
We study problems of scheduling jobs on related machines so as to minimize the makespan in the setting where machines are strategic agents. In this problem, each job j has a lengt...
136
Voted
ASPLOS
2006
ACM
15 years 8 months ago
2006
ACM
This paper explores hierarchical instruction scheduling for a tiled processor. Our results show that at the top level of the hierarchy, a simple profile-driven algorithm effective...
169
click to vote
PLDI
1995
ACM
15 years 8 months ago
1995
ACM
Traditional list schedulers order instructions based on an optimistic estimate of the load latency imposed by the hardware and therefore cannot respond to variations in memory lat...
168
click to vote
DATE
1999
IEEE
15 years 9 months ago
1999
IEEE
Reachability analysis of finite state machines is essential to many computer-aided design applications. We present new techniques to improve both approximate and exact reachabilit...