Sciweavers

1332 search results - page 114 / 267
» Scalability versus Execution Time in Scalable Systems
Sort
View
IPM
2006
75views more  IPM 2006»
14 years 10 months ago
Performance of query processing implementations in ranking-based text retrieval systems using inverted indices
Similarity calculations and document ranking form the computationally expensive parts of query processing in ranking-based text retrieval. In this work, for these calculations, 11...
Berkant Barla Cambazoglu, Cevdet Aykanat
OSDI
2002
ACM
15 years 10 months ago
Integrated Resource Management for Cluster-based Internet Services
Client request rates for Internet services tend to be bursty and thus it is important to maintain efficient resource utilization under a wide range of load conditions. Network ser...
Kai Shen, Hong Tang, Tao Yang, Lingkun Chu
PPOPP
2009
ACM
15 years 10 months ago
Compiler-assisted dynamic scheduling for effective parallelization of loop nests on multicore processors
Recent advances in polyhedral compilation technology have made it feasible to automatically transform affine sequential loop nests for tiled parallel execution on multi-core proce...
Muthu Manikandan Baskaran, Nagavijayalakshmi Vydya...
P2P
2003
IEEE
110views Communications» more  P2P 2003»
15 years 3 months ago
Range Addressable Network: A P2P Cache Architecture for Data Ranges
Peer-to-peer computing paradigm is emerging as a scalable and robust model for sharing media objects. In this paper, we propose an architecture and describe the associated algorit...
Anshul Kothari, Divyakant Agrawal, Abhishek Gupta,...
OSDI
2004
ACM
15 years 10 months ago
MapReduce: Simplified Data Processing on Large Clusters
MapReduce is a programming model and an associated implementation for processing and generating large data sets. Users specify a map function that processes a key/value pair to ge...
Jeffrey Dean, Sanjay Ghemawat