Sciweavers

2494 search results - page 254 / 499
» Dependable Distributed Computing Using Free Databases
Sort
View
DCOSS
2008
Springer
13 years 10 months ago
Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
Andreas Wiese, Evangelos Kranakis
PPOPP
1999
ACM
14 years 16 days ago
Automatic Node Selection for High Performance Applications on Networks
A central problem in executing performance critical parallel and distributed applications on shared networks is the selection of computation nodes and communication paths for exec...
Jaspal Subhlok, Peter Lieu, Bruce Lowekamp
ICDE
2009
IEEE
177views Database» more  ICDE 2009»
14 years 10 months ago
Light-Weight, Runtime Verification of Query Sources
Modern database systems increasingly make use of networked storage. This storage can be in the form of SAN's or in the form of shared-nothing nodes in a cluster. One type of a...
Tingjian Ge, Stanley B. Zdonik
ICDCS
2006
IEEE
14 years 2 months ago
PRINS: Optimizing Performance of Reliable Internet Storages
Distributed storage systems employ replicas or erasure code to ensure high reliability and availability of data. Such replicas create great amount of network traffic that negative...
Qing Yang, Weijun Xiao, Jin Ren
HIPC
2000
Springer
13 years 11 months ago
Meta-data Management System for High-Performance Large-Scale Scientific Data Access
Many scientific applications manipulate large amount of data and, therefore, are parallelized on high-performance computing systems to take advantage of their computational power a...
Wei-keng Liao, Xiaohui Shen, Alok N. Choudhary