Sciweavers

611 search results - page 98 / 123
» Highly scalable parallel sorting
Sort
View
EUROPAR
1997
Springer
14 years 1 months ago
Prefetching and Multithreading Performance in Bus-Based Multiprocessors with Petri Nets
The large latency of memory accesses is a major obstacle in obtaining high processor utilization in large scale shared-memory multiprocessors. Access to remote memory is likely to ...
Edward D. Moreno, Sergio Takeo Kofuji, Marcelo H. ...
DCOSS
2006
Springer
14 years 15 days ago
The Virtual Pheromone Communication Primitive
We propose a generic communication primitive designed for sensor networks. Our primitive hides details of network communication while retaining sufficient programmer control over t...
Leo Szumel, John D. Owens
EUROPAR
2008
Springer
13 years 10 months ago
Complex Queries for Moving Object Databases in DHT-Based Systems
Abstract. Distributed moving object database servers are a feasible solution to the scalability problem of centralized database systems. In this paper we propose a distributed inde...
Cecilia Hernández, M. Andrea Rodrígu...
CCGRID
2010
IEEE
13 years 10 months ago
Dynamic TTL-Based Search in Unstructured Peer-to-Peer Networks
Abstract--Resource discovery is a challenging issue in unstructured peer-to-peer networks. Blind search approaches, including flooding and random walks, are the two typical algorit...
Imen Filali, Fabrice Huet
OSDI
2004
ACM
14 years 9 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