Sciweavers

790 search results - page 26 / 158
» Limits of Work-Stealing Scheduling
Sort
View
CASES
2011
ACM
14 years 6 months ago
Cost-effective safety and fault localization using distributed temporal redundancy
Cost pressure is driving vendors of safety-critical systems to integrate previously distributed systems. One natural approach we have previous introduced is On-Demand Redundancy (...
Brett H. Meyer, Benton H. Calhoun, John Lach, Kevi...
RTSS
2009
IEEE
16 years 22 days ago
On the Implementation of Global Real-Time Schedulers
An empirical study of implementation tradeoffs (choice of ready queue implementation, quantum-driven vs. eventdriven scheduling, and interrupt handling strategy) affecting global ...
Björn B. Brandenburg, James H. Anderson
ICC
2008
IEEE
109views Communications» more  ICC 2008»
16 years 14 days ago
Wireless Scheduling Algorithms with O(1) Overhead for M-Hop Interference Model
Abstract—We develop a family of distributed wireless scheduling algorithms that requires only O(1) complexity for M-hop interference model, for any finite M. The recent technolo...
Yung Yi, Mung Chiang
GLOBECOM
2007
IEEE
16 years 10 days ago
Joint Computation and Communication Scheduling to Enable Rich Mobile Applications
Abstract—Increasing interest in sensor networking and ubiquitous computing has created a trend towards embedding more and more intelligence into our surroundings. This enables th...
Shoubhik Mukhopadhyay, Curt Schurgers, Sujit Dey
WIOPT
2006
IEEE
16 years 12 hour ago
Ad Hoc networks with topology-transparent scheduling schemes: Scaling laws and capacity/delay tradeoffs
— In this paper we investigate the limiting properties, in terms of capacity and delay, of an ad hoc network employing a topology-transparent scheduling scheme. In particular, we...
Daniele Miorandi, Hwee Pink Tan, Michele Zorzi