Sciweavers

927 search results - page 100 / 186
» Measuring Consistency Costs for Distributed Shared Data
Sort
View
139
Voted
TES
2001
Springer
15 years 5 months ago
Security for Distributed E-Service Composition
Current developments show that tomorrow’s information systems and applications will no longer be based on monolithic architectures that encompass all the functionality. Rather, t...
Stefan Seltzsam, Stephan Börzsönyi, Alfo...
88
Voted
VLDB
1997
ACM
78views Database» more  VLDB 1997»
15 years 4 months ago
Recovering Information from Summary Data
Data is often stored in summarized form, as a histogram of aggregates (COUNTs, SUMs, or AVeraGes) over speci ed ranges. We study how to estimate the original detail data from the ...
Christos Faloutsos, H. V. Jagadish, Nikolaos Sidir...
131
Voted
PDCN
2004
15 years 2 months ago
Speculative prefetching of optional locks in distributed systems
We present a family of methods for speeding up distributed locks by exploiting the uneven distribution of both temporal and spatial locality of access behaviour of many applicatio...
Thomas Schöbel-Theuer
MTA
2007
110views more  MTA 2007»
15 years 6 days ago
On aggregate available bandwidth in many-to-one data transfer - modeling and applications
Abstract This work investigates the modeling of aggregate available bandwidth in multisender network applications. Unlike the well-established client–server model, where there is...
S. C. Hui, Jack Y. B. Lee
107
Voted
JPDC
2007
96views more  JPDC 2007»
15 years 18 days ago
Optimal pipeline decomposition and adaptive network mapping to support distributed remote visualization
This paper discusses algorithmic and implementation aspects of a distributed remote visualization system that optimally decomposes and adaptively maps the visualization pipeline t...
Mengxia Zhu, Qishi Wu, Nageswara S. V. Rao, S. Sit...