Sciweavers

159 search results - page 26 / 32
» Service-Based Distributed Querying on the Grid
Sort
View
PDPTA
2007
14 years 8 days ago
LEGS: A WSRF Service to Estimate Latency Between Arbitrary Hosts on the Internet
: The ability to estimate the communication latency between arbitrary hosts on the Internet would enable the distributed computing applications to find the closest server or to fin...
R. Vijayprasanth, R. Kavithaa, Rajkumar Kettimuthu
ICDE
2006
IEEE
183views Database» more  ICDE 2006»
14 years 4 months ago
Similarity Queries on Structured Data in Structured Overlays
Structured P2P systems based on distributed hash tables are a popular choice for building large-scaled data management systems. Generally, they only support exact match queries, b...
Marcel Karnstedt, Kai-Uwe Sattler, Manfred Hauswir...
CCGRID
2003
IEEE
14 years 4 months ago
Multi-class Applications for Parallel Usage of a Guaranteed Rate and a Scavenger Service
— Grid computing requires network services beyond what is currently provided by the Best-Effort Internet. Among the different approaches towards network Quality of Service, aggre...
Markus Fidler, Volker Sander
GPC
2007
Springer
14 years 5 months ago
Design of PeerSum: A Summary Service for P2P Applications
Sharing huge databases in distributed systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer sufficient. A more ef...
Rabab Hayek, Guillaume Raschia, Patrick Valduriez,...
DPD
2006
141views more  DPD 2006»
13 years 11 months ago
Efficient parallel processing of range queries through replicated declustering
A common technique used to minimize I/O in data intensive applications is data declustering over parallel servers. This technique involves distributing data among several disks so...
Hakan Ferhatosmanoglu, Ali Saman Tosun, Guadalupe ...