5640 search results - page 525 / 1128 » Parallelizing the Data Cube |
126
Voted
CLUSTER
2003
IEEE
15 years 10 months ago
2003
IEEE
Extendible hashing is a kind of fast indexing technology; it provides with a way of storing structural data records so that each of them can be gotten very quickly. In this paper,...
111
click to vote
EUROPAR
2005
Springer
15 years 10 months ago
2005
Springer
Large message latencies often lead to poor performance of parallel applications. In this paper, we investigate a latency-tolerating technique that immediately releases all blocking...
131
click to vote
PDP
2002
IEEE
15 years 9 months ago
2002
IEEE
We present the Ka-admin project that addresses the problem of collecting, visualizing and feeding back any grid information, trace or snapshot, compliant to an XML-like model. Rea...
124
click to vote
ICA3PP
2009
Springer
15 years 9 months ago
2009
Springer
In-memory data sharing for grids allow location-transparent access to data stored in volatile memory. Existing Grid middlewares typ- ically support only explicit data transfer betw...
148
click to vote
ICPP
1993
IEEE
15 years 9 months ago
1993
IEEE
SIMD or vector computers and collection-oriented languages, like C , are designed to perform the same computation on each data item or on just a subset of the data. Subsets of pro...