Sciweavers

1074 search results - page 30 / 215
» An ASM-Characterization of a Class of Distributed Algorithms
Sort
View
JGAA
2000
179views more  JGAA 2000»
14 years 9 months ago
Approximation Algorithms for Some Graph Partitioning Problems
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
George He, Jiping Liu, Cheng Zhao
IPPS
1997
IEEE
15 years 1 months ago
A Randomized Sorting Algorithm on the BSP model
We present a new randomized sorting algorithm on the Bulk-SynchronousParallel (BSP) model. The algorithm improves upon the parallel slack of previous algorithms to achieve optimal...
Alexandros V. Gerbessiotis, Constantinos J. Siniol...
IWQOS
2004
Springer
15 years 3 months ago
Towards content distribution networks with latency guarantees
This paper investigates the performance of a content distribution network designed to provide bounded content access latency. Content can be divided into multiple classes with dif...
Chengdu Huang, Tarek F. Abdelzaher
86
Voted
WDAG
2007
Springer
132views Algorithms» more  WDAG 2007»
15 years 3 months ago
Detecting Temporal Logic Predicates on Distributed Computations
Abstract. We examine the problem of detecting nested temporal predicates given the execution trace of a distributed program. We present a technique that allows efficient detection ...
Vinit A. Ogale, Vijay K. Garg
ISPA
2007
Springer
15 years 3 months ago
Distributed Multi-source Regular Path Queries
Regular path queries are the building block of almost any mechanism for querying semistructured data. Despite the fact that the main applications of such data are distributed, ther...
Maryam Shoaran, Alex Thomo