Sciweavers

373 search results - page 13 / 75
» Local Scheduling for Volunteer Computing
Sort
View
MOBIHOC
2010
ACM
13 years 5 months ago
Longest-queue-first scheduling under SINR interference model
We investigate the performance of longest-queue-first (LQF) scheduling (i.e., greedy maximal scheduling) for wireless networks under the SINR interference model. This interference...
Long Bao Le, Eytan Modiano, Changhee Joo, Ness B. ...
CHI
2007
ACM
14 years 8 months ago
Jogging the distance
People enjoy jogging with others for social and motivational reasons. However, as reported by forum participants, finding a compatible, local jogging partner who shares the abilit...
Shannon O'Brien, Florian Mueller
ASPLOS
1992
ACM
13 years 12 months ago
High Speed Switch Scheduling for Local Area Networks
Current technology trends make it possible to build communication networks that can support high performance distributed computing. This paper describes issues in the design of a ...
Thomas E. Anderson, Susan S. Owicki, James B. Saxe...
RTSS
2005
IEEE
14 years 1 months ago
Hierarchical Fixed Priority Pre-Emptive Scheduling
This paper focuses on the hierarchical scheduling of systems where a number of separate applications reside on a single processor. It addresses the particular case where fixed pri...
Robert I. Davis, Alan Burns
JNW
2008
101views more  JNW 2008»
13 years 7 months ago
Computational Time-Division and Code-Division Channel Access Scheduling in Ad Hoc Networks
Using two-hop neighborhood information, we present the hybrid activation multiple access (HAMA) protocol for time-division channel access scheduling in ad hoc networks with omni-di...
Lichun Bao, J. J. Garcia-Luna-Aceves