Sciweavers

279 search results - page 36 / 56
» Low Overhead Parallel Schedules for Task Graphs
Sort
View
TC
2002
13 years 7 months ago
Performance Modeling and Prediction of Nondedicated Network Computing
The low cost and wide availability of networks of workstations have made them an attractive solution for high performance computing. However, while a network of workstations may be...
Linguo Gong, Xian-He Sun, Edward F. Watson
TSE
1998
128views more  TSE 1998»
13 years 7 months ago
Modeling and Evaluating Design Alternatives for an On-Line Instrumentation System: A Case Study
—This paper demonstrates the use of a model-based evaluation approach for instrumentation systems (ISs). The overall objective of this study is to provide early feedback to tool ...
Abdul Waheed, Diane T. Rover, Jeffrey K. Hollingsw...
PPOPP
2009
ACM
14 years 8 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
ECRTS
2010
IEEE
13 years 9 months ago
Partitioning Parallel Applications on Multiprocessor Reservations
A full exploitation of the computational power available in a multi-core platform requires the software to be specified in terms of parallel execution flows. At the same time, mode...
Giorgio C. Buttazzo, Enrico Bini, Yifan Wu
SPAA
2005
ACM
14 years 1 months ago
Value-maximizing deadline scheduling and its application to animation rendering
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...
Eric Anderson, Dirk Beyer 0002, Kamalika Chaudhuri...