Sciweavers

10608 search results - page 641 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
PDP
2003
IEEE
16 years 15 days ago
Scheduling strategies for mixed data and task parallelism on heterogeneous clusters and grids
We consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent pr...
Olivier Beaumont, Arnaud Legrand, Yves Robert
IFL
2003
Springer
128views Formal Methods» more  IFL 2003»
16 years 13 days ago
With-Loop Scalarization - Merging Nested Array Operations
Construction of complex array operations by composition of more basic ones allows for abstract and concise specifications of algorithms. Unfortunately, na¨ıve compilation of suc...
Clemens Grelck, Sven-Bodo Scholz, Kai Trojahner
IPTPS
2003
Springer
16 years 13 days ago
A Simple Fault Tolerant Distributed Hash Table
We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of log n and is ro...
Moni Naor, Udi Wieder
PLDI
1998
ACM
15 years 11 months ago
Simplification of Array Access Patterns for Compiler Optimizations
Existing array region representation techniques are sensitive to the complexity of array subscripts. In general, these techniques are very accurate and efficient for simple subscr...
Yunheung Paek, Jay Hoeflinger, David A. Padua
VLDB
1997
ACM
140views Database» more  VLDB 1997»
15 years 11 months ago
Parallel Query Scheduling and Optimization with Time- and Space-Shared Resources
Scheduling query execution plans is a particularly complex problem in hierarchical parallel systems, where each site consists of a collection of local time-shared (e.g., CPU(s) or...
Minos N. Garofalakis, Yannis E. Ioannidis