Sciweavers

4081 search results - page 5 / 817
» Scheduling in polling systems
Sort
View
ICDE
2003
IEEE
73views Database» more  ICDE 2003»
15 years 11 months ago
Scalable Application-Aware Data Freshening
Distributed databases and other networked information systems use copies or mirrors to reduce latency and to increase availability. Copies need to be refreshed. In a loosely coupl...
Donald Carney, Sangdon Lee, Stanley B. Zdonik
PPOPP
1995
ACM
15 years 1 months ago
Optimistic Active Messages: A Mechanism for Scheduling Communication with Computation
Low-overhead message passing is critical to the performance of many applications. Active Messages[27] reduce the software overhead for message handling: messages are run as handle...
Deborah A. Wallach, Wilson C. Hsieh, Kirk L. Johns...
61
Voted
HICSS
2003
IEEE
93views Biometrics» more  HICSS 2003»
15 years 2 months ago
Performance of Bluetooth Bridges in Scatternets With Exhaustive Service Scheduling
— The performance of two Bluetooth piconets linked through a bridge device is analyzed using the tools of queueing theory. We analyze both the Master/Slave (MS) and Slave/Slave (...
Jelena V. Misic, Vojislav B. Misic
IPPS
2007
IEEE
15 years 3 months ago
A Flexible Resource Management Architecture for the Blue Gene/P Supercomputer
Blue Gene R /P is a massively parallel supercomputer intended as the successor to Blue Gene/L. It leverages much of the existing architecture of its predecessor to provide scalabi...
Sam Miller, Mark Megerian, Paul Allen, Tom Budnik
ISCC
2008
IEEE
110views Communications» more  ISCC 2008»
15 years 3 months ago
Model for polling in noisy multihop systems with application to PLC and AMR
The present paper presents a Markov Chain model of polling in noisy multi-hop systems typical of Power Line Communications (PLC) as well as of other systems. The model includes the...
Joseph M. Selga, Agustín Zaballos, Jaume Ab...