Sciweavers

874 search results - page 6 / 175
» Predicting the Running Times of Parallel Programs by Simulat...
Sort
View
ISCAPDCS
2004
14 years 11 months ago
FG: A Framework Generator for Hiding Latency in Parallel Programs Running on Clusters
FG is a programming environment for asynchronous programs that run on clusters and fit into a pipeline framework. It enables the programmer to write a series of synchronous functi...
Thomas H. Cormen, Elena Riccio Davidson
STOC
2001
ACM
115views Algorithms» more  STOC 2001»
15 years 10 months ago
Running time and program size for self-assembled squares
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-De...
PPL
2008
124views more  PPL 2008»
14 years 9 months ago
Experimental Evaluation of BSP Programming Libraries
The model of bulk-synchronous parallel computation (BSP) helps to implement portable general purpose algorithms while keeping predictable performance on different parallel compute...
Peter Krusche
ICCD
2007
IEEE
139views Hardware» more  ICCD 2007»
15 years 6 months ago
Statistical simulation of chip multiprocessors running multi-program workloads
This paper explores statistical simulation as a fast simulation technique for driving chip multiprocessor (CMP) design space exploration. The idea of statistical simulation is to ...
Davy Genbrugge, Lieven Eeckhout
WSC
2007
14 years 12 months ago
Applying parallel and distributed simulation to remote network emulation
Many of today’s military services and applications run on geographically distributed sites and need to be tested and evaluated under realistic scenarios with many unpredictable ...
Yan Gu, Richard Fujimoto