Sciweavers

1257 search results - page 234 / 252
» Near-Optimal Scheduling of Distributed Algorithms
Sort
View
ICCS
2004
Springer
15 years 3 months ago
Using Runtime Measurements and Historical Traces for Acquiring Knowledge in Parallel Applications
Abstract. A new approach for acquiring knowledge of parallel applications regarding resource usage and for searching similarity on workload traces is presented. The main goal is to...
Luciano José Senger, Marcos José San...
RTSS
2003
IEEE
15 years 3 months ago
Addressing Timeliness/Accuracy/Cost Tradeoffs in Information Collection for Dynamic Environments
In this paper, we focus on addressing the tradeoffs between timeliness, accuracy and cost for applications requiring real-time information collection in distributed real-time envi...
Qi Han, Nalini Venkatasubramanian
IPTPS
2003
Springer
15 years 3 months ago
Scooped, Again
The Peer-to-Peer (p2p) and Grid infrastructure communities are tackling an overlapping set of problems. In addressing these problems, p2p solutions are usually motivated by elegan...
Jonathan Ledlie, Jeffrey Shneidman, Margo I. Seltz...
EUROPAR
2009
Springer
15 years 2 months ago
Real-Time Issues in Live Migration of Virtual Machines
This paper addresses the issue of how to meet the strict timing constraints of (soft) real-time virtualized applications while the Virtual Machine (VM) hosting them is undergoing a...
Fabio Checconi, Tommaso Cucinotta, Manuel Stein
CONEXT
2007
ACM
15 years 1 months ago
Practical service provisioning for wireless meshes
Community wireless mesh networks (WMNs) are increasingly being deployed for providing cheap, low maintenance Internet access. For the successful adoption of WMNs as a last-mile te...
Saumitra M. Das, Dimitrios Koutsonikolas, Y. Charl...