Sciweavers

201 search results - page 13 / 41
» Estimating the Parallel Start-Up Overhead for Parallelizing ...
Sort
View
ICPP
1998
IEEE
13 years 11 months ago
Supporting Software Distributed Shared Memory with an Optimizing Compiler
To execute a shared memory program efficiently, we have to manage memory consistency with low overheads, and have to utilize communication bandwidth of the platform as much as pos...
Tatsushi Inagaki, Junpei Niwa, Takashi Matsumoto, ...
LCPC
2001
Springer
13 years 12 months ago
Bridging the Gap between Compilation and Synthesis in the DEFACTO System
Abstract. The DEFACTO project - a Design Environment For Adaptive Computing TechnOlogy - is a system that maps computations, expressed in high-level languages such as C, directly o...
Pedro C. Diniz, Mary W. Hall, Joonseok Park, Byoun...
HPDC
1994
IEEE
13 years 11 months ago
Network Partitioning of Data Parallel Computations
Partitioning data parallel computations across a network of heterogeneous workstations is a dificult problem for the user: We have developed a runtime partitioning methodfor choos...
Jon B. Weissman, Andrew S. Grimshaw
ISORC
2005
IEEE
14 years 1 months ago
On Real-Time Performance of Ahead-of-Time Compiled Java
One of the main challenges in getting acceptance for safe object-oriented languages in hard real-time systems is to combine automatic memory management with hard real-time constra...
Anders Nilsson, Sven Gestegard Robertz
AAAI
2010
13 years 9 months ago
Parallel Depth First Proof Number Search
The depth first proof number search (df-pn) is an effective and popular algorithm for solving and-or tree problems by using proof and disproof numbers. This paper presents a simpl...
Tomoyuki Kaneko