92 search results - page 3 / 19 » Optimal versus Heuristic Global Code Scheduling |
PODC
2009
ACM
15 years 10 months ago
2009
ACM
Transactional memories are typically speculative and rely on contention managers to cure conflicts. This paper explores a complementary approach that prevents conflicts by schedul...
103
click to vote
ASPLOS
2008
ACM
14 years 11 months ago
2008
ACM
The recent shift in the industry towards chip multiprocessor (CMP) designs has brought the need for multi-threaded applications to mainstream computing. As observed in several lim...
120
click to vote
PATMOS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Until now, the great majority of research in low-power systems has assumed a convex power model. However, recently, due to the confluence of emerging technological and ar...
MICRO
1998
IEEE
15 years 1 months ago
1998
IEEE
Path profiles record the frequencies of execution paths through a program. Until now, the best global instruction schedulers have relied upon profile-gathered frequencies of condi...
110
click to vote
IEEEPACT
1998
IEEE
15 years 1 months ago
1998
IEEE
In this paper, we present an efficient algorithm, called CASS-II, for task clustering without task duplication. Unlike the DSC algorithm, which is empirically the best known algor...