Sciweavers

1594 search results - page 107 / 319
» Visualizing Program Executions on Large Data Sets
Sort
View
CLOUD
2010
ACM
15 years 8 months ago
Towards automatic optimization of MapReduce programs
Timely and cost-effective processing of large datasets has become a critical ingredient for the success of many academic, government, and industrial organizations. The combination...
Shivnath Babu
CCGRID
2006
IEEE
15 years 6 months ago
Compilation of XSLT into Dataflow Graphs for Web Service Composition
Our current research into programming models for parallel web services composition is targeted at providing mechanisms for obtaining higher throughput for large scale compute and ...
Peter M. Kelly, Paul D. Coddington, Andrew L. Wend...
KDD
2008
ACM
274views Data Mining» more  KDD 2008»
16 years 3 months ago
Data mining using high performance data clouds: experimental studies using sector and sphere
We describe the design and implementation of a high performance cloud that we have used to archive, analyze and mine large distributed data sets. By a cloud, we mean an infrastruc...
Robert L. Grossman, Yunhong Gu
157
Voted
ICALP
1994
Springer
15 years 7 months ago
Simple Fast Parallel Hashing
A hash table is a representation of a set in a linear size data structure that supports constanttime membership queries. We show how to construct a hash table for any given set of...
Joseph Gil, Yossi Matias
JSS
2006
85views more  JSS 2006»
15 years 2 months ago
Effects of context on program slicing
Whether context-sensitive program analysis is more effective than context-insensitive analysis is an ongoing discussion. There is evidence that context-sensitivity matters in comp...
Jens Krinke