Sciweavers

6542 search results - page 163 / 1309
» The tao of parallelism in algorithms
Sort
View
SIAMCOMP
1998
137views more  SIAMCOMP 1998»
15 years 6 months ago
Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover probl...
Sridhar Rajagopalan, Vijay V. Vazirani
PDP
2010
IEEE
16 years 1 months ago
Skandium: Multi-core Programming with Algorithmic Skeletons
—This paper argues that algorithmic skeletons are a suitable programming model for multi-core architectures. -level abstractions offered by algorithmic skeletons provide a simple...
Mario Leyton, José M. Piquer
IPPS
1997
IEEE
15 years 10 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...
SKG
2005
IEEE
16 years 3 days ago
A Grid Service Infrastructure for Mobile Devices
One of the visions of Grid computing is to access computational resources automatically on demand to deliver the services required with appropriate quality. Because mobile devices ...
Tao Guan, Ed Zaluska, David De Roure
GCC
2005
Springer
15 years 12 months ago
Characterizing Services Composeability and OWL-S Based Services Composition
Grid has emerged as a new paradigm for integration within dynamic virtual enterprises. Given a service-oriented Grid environment, more complex, value-added sophisticated services a...
Zhonghua Yang, Jing-Bing Zhang, Jiao Tao, Robert K...