Sciweavers

18 search results - page 3 / 4
» Lower-bound estimation for multi-bitwidth scheduling
Sort
View
INFOCOM
2008
IEEE
14 years 20 days ago
Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multi-Hop Wireless Networks
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 ...
Changhee Joo, Xiaojun Lin, Ness B. Shroff
IROS
2007
IEEE
107views Robotics» more  IROS 2007»
14 years 17 days ago
Scheduling for humans in multirobot supervisory control
—This paper describes efficient utilization of human time by two means: prioritization of human tasks and maximizing multirobot team size. We propose an efficient scheduling algo...
Sandra Mau, John M. Dolan
ASPDAC
2005
ACM
98views Hardware» more  ASPDAC 2005»
13 years 11 months ago
Bitwidth-aware scheduling and binding in high-level synthesis
- Many high-level description languages, such as C/C++ or Java, lack the capability to specify the bitwidth information for variables and operations. Synthesis from these specifica...
Jason Cong, Yiping Fan, Guoling Han, Yizhou Lin, J...
MST
2000
57views more  MST 2000»
13 years 6 months ago
On Scheduling Parallel Tasks at Twilight
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
Hannah Bast
ISCA
2007
IEEE
120views Hardware» more  ISCA 2007»
14 years 17 days ago
Examining ACE analysis reliability estimates using fault-injection
ACE analysis is a technique to provide an early reliability estimate for microprocessors. ACE analysis couples data from performance models with low level design details to identi...
Nicholas J. Wang, Aqeel Mahesri, Sanjay J. Patel