Sciweavers

405 search results - page 21 / 81
» A Parallel Priority Data Structure with Applications
Sort
View
100
Voted
CLUSTER
2008
IEEE
15 years 9 months ago
Redistribution aware two-step scheduling for mixed-parallel applications
— Applications raising in many scientific fields exhibit both data and task parallelism that have to be exploited efficiently. A classic approach is to structure those applica...
Sascha Hunold, Thomas Rauber, Frédér...
136
Voted
PLDI
2011
ACM
14 years 5 months ago
The tao of parallelism in algorithms
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regular...
Keshav Pingali, Donald Nguyen, Milind Kulkarni, Ma...
120
Voted
CLUSTER
2006
IEEE
15 years 2 months ago
A flexible multi-dimensional QoS performance measure framework for distributed heterogeneous systems
When users' tasks in a distributed heterogeneous computing environment (e.g., cluster of heterogeneous computers) are allocated resources, the total demand placed on some sys...
Jong-Kook Kim, Debra A. Hensgen, Taylor Kidd, Howa...
PDP
2008
IEEE
15 years 9 months ago
Distributed Sparse Spatial Selection Indexes
Searching for similar objects in metric-space databases can be efficiently solved by using index data structures. A number of alternative sequential indexes have been proposed in...
Veronica Gil Costa, Mauricio Marín
128
Voted
ICDCS
1998
IEEE
15 years 6 months ago
Structuring Remote Object Systems for Mobile Hosts with Intermittent Connectivity
In distributed object systems, remote method inattempts to abstract communication between di erent machines to the level of object method invocation. Link failure in such systems ...
Girish Welling, Maximilian Ott