Sciweavers

9 search results - page 1 / 2
» Improving Quasi-Dynamic Schedules through Region Slip
Sort
View
CGO
2003
IEEE
13 years 10 months ago
Improving Quasi-Dynamic Schedules through Region Slip
Modern processors perform dynamic scheduling to achieve better utilization of execution resources. A schedule created at run-time is often better than one created at compile-time ...
Francesco Spadini, Brian Fahs, Sanjay J. Patel, St...
TIT
2008
119views more  TIT 2008»
13 years 4 months ago
Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks
We address the question of providing throughput guarantees through distributed scheduling, which has remained an open problem for some time. We consider a simple distributed sched...
Prasanna Chaporkar, Koushik Kar, Xiang Luo, Saswat...
MICRO
2006
IEEE
132views Hardware» more  MICRO 2006»
13 years 11 months ago
Data-Dependency Graph Transformations for Superblock Scheduling
The superblock is a scheduling region which exposes instruction level parallelism beyond the basic block through speculative execution of instructions. In general, scheduling supe...
Mark Heffernan, Kent D. Wilken, Ghassan Shobaki
MICRO
1998
IEEE
139views Hardware» more  MICRO 1998»
13 years 9 months ago
Better Global Scheduling Using Path Profiles
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...
Cliff Young, Michael D. Smith
WWW
2008
ACM
14 years 5 months ago
Information "uptrieval": exploring models for content assimilation and aggregation for developing regions
Information Retrieval on the WWW is important because it is hard to find what one is looking for. There is a plethora of information available, and searching relevant information ...
Sheetal K. Agarwal, Arun Kumar, Sougata Mukherjea,...