Sciweavers

1263 search results - page 242 / 253
» Performance of the IBM General Parallel File System
Sort
View
PEPM
2009
ACM
15 years 6 months ago
Self-adjusting computation: (an overview)
Many applications need to respond to incremental modifications to data. Being incremental, such modification often require incremental modifications to the output, making it po...
Umut A. Acar
PODC
2005
ACM
15 years 3 months ago
Routing complexity of faulty networks
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
78
Voted
DEBS
2008
ACM
14 years 11 months ago
Event-based constraints for sensornet programming
We propose a sensornet programming model based on declarative spatio-temporal constraints on events only, not sensors. Where previous approaches conflate events and sensors becaus...
Jie Mao, John Jannotti, Mert Akdere, Ugur Ç...
WWW
2011
ACM
14 years 4 months ago
Counting triangles and the curse of the last reducer
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
Siddharth Suri, Sergei Vassilvitskii
HPDC
2007
IEEE
15 years 4 months ago
Towards adaptive, scalable, and reliable resource provisioning for wsrf-compliant applications
Although WSRF (Web Services Resource Framework) and Java-based hosting environment have been successful in dealing with the heterogeneity of resources and the diversity of applica...
Eun-Kyu Byun, Jae-Wan Jang, Jin-Soo Kim