Sciweavers

279 search results - page 30 / 56
» Low Overhead Parallel Schedules for Task Graphs
Sort
View
IISWC
2008
IEEE
14 years 2 months ago
Characterizing and improving the performance of Intel Threading Building Blocks
Abstract— The Intel Threading Building Blocks (TBB) runtime library [1] is a popular C++ parallelization environment [2][3] that offers a set of methods and templates for creatin...
Gilberto Contreras, Margaret Martonosi
HPCN
2000
Springer
13 years 11 months ago
Data Futures in DISCWorld
Data futures in a metacomputing system refer to data products that have not yet been created but which can be uniquely named and manipulated. We employ data flow mechanisms expres...
Heath A. James, Kenneth A. Hawick
IPPS
2009
IEEE
14 years 2 months ago
Minimizing startup costs for performance-critical threading
—Using the well-known ATLAS and LAPACK dense linear algebra libraries, we demonstrate that the parallel management overhead (PMO) can grow with problem size on even statically sc...
Anthony M. Castaldo, R. Clint Whaley
EUROPAR
2005
Springer
14 years 1 months ago
SPC-XML: A Structured Representation for Nested-Parallel Programming Languages
Nested-parallelism programming models, where the task graph associated to a computation is series-parallel, present good analysis properties that can be exploited for scheduling, c...
Arturo González-Escribano, Arjan J. C. van ...
ICDCS
2008
IEEE
14 years 2 months ago
Distributed Connected Dominating Set Construction in Geometric k-Disk Graphs
In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in w...
Kai Xing, Wei Cheng, E. K. Park, Shmuel Rotenstrei...