Sciweavers

1098 search results - page 156 / 220
» Large-Scale Parallel Data Clustering
Sort
View
179
Voted
PPOPP
2010
ACM
15 years 12 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...
111
Voted
CLUSTER
2002
IEEE
15 years 7 months ago
User-Level Remote Data Access in Overlay Metacomputers
A practical problem faced by users of metacomputers and computational grids is: If my computation can move from one system to another, how can I ensure that my data will still be ...
Jeff Siegel, Paul Lu
128
Voted
ISPASS
2007
IEEE
15 years 9 months ago
Simplifying Active Memory Clusters by Leveraging Directory Protocol Threads
Address re-mapping techniques in so-called active memory systems have been shown to dramatically increase the performance of applications with poor cache and/or communication beha...
Dhiraj D. Kalamkar, Mainak Chaudhuri, Mark Heinric...
160
Voted
CLUSTER
2000
IEEE
15 years 2 months ago
Data management for large-scale scientific computations in high performance distributed systems
With the increasing number of scientific applications manipulating huge amounts of data, effective high-level data management is an increasingly important problem. Unfortunately, ...
Alok N. Choudhary, Mahmut T. Kandemir, Jaechun No,...
151
Voted
ICPADS
2010
IEEE
15 years 17 days ago
Enhancing MapReduce via Asynchronous Data Processing
The MapReduce programming model simplifies large-scale data processing on commodity clusters by having users specify a map function that processes input key/value pairs to generate...
Marwa Elteir, Heshan Lin, Wu-chun Feng