Sciweavers

96 search results - page 15 / 20
» Executing task graphs using work-stealing
Sort
View
AAAI
2004
13 years 9 months ago
Shortest Path Discovery Problems: A Framework, Algorithms and Experimental Results
In this paper we introduce and study Shortest Path Discovery (SPD) problems, a generalization of shortest path problems: In SPD one is given a directed edgeweighted graph and the ...
Csaba Szepesvári
HCW
1999
IEEE
13 years 12 months ago
A Unified Resource Scheduling Framework for Heterogeneous Computing Environments
A major challenge in Metacomputing Systems (Computational Grids) is to effectively use their shared resources, such as compute cycles, memory, communication network, and data repo...
Ammar H. Alhusaini, Viktor K. Prasanna, Cauligi S....
VEE
2012
ACM
187views Virtualization» more  VEE 2012»
12 years 3 months ago
DDGacc: boosting dynamic DDG-based binary optimizations through specialized hardware support
Dynamic Binary Translators (DBT) and Dynamic Binary Optimization (DBO) by software are used widely for several reasons including performance, design simplification and virtualiza...
Demos Pavlou, Enric Gibert, Fernando Latorre, Anto...
PACT
2009
Springer
14 years 3 days ago
Parallel Evidence Propagation on Multicore Processors
In this paper, we design and implement an efficient technique for parallel evidence propagation on state-of-the-art multicore processor systems. Evidence propagation is a major ste...
Yinglong Xia, Xiaojun Feng, Viktor K. Prasanna
ICSE
1995
IEEE-ACM
13 years 11 months ago
A Compact Petri Net Representation for Concurrent Programs
This paper presents a compact Petri net representation that is e cient to construct for concurrent programs that use explicit tasking and rendezvous style communication. These Pet...
Matthew B. Dwyer, Lori A. Clarke, Kari A. Nies