Sciweavers

1024 search results - page 25 / 205
» Complexity and Performance in Parallel Programming Languages
Sort
View
ISPAN
1999
IEEE
14 years 28 days ago
Performance and Granularity Control in the SPaDES Parallel Simulation System
Parallel simulationhas the potentialto accelerate the execution of simulation applications. However, developing a parallel discrete-event simulation from scratch requires an in-de...
Yong Meng Teo, Seng Chuan Tay
IPPS
2006
IEEE
14 years 2 months ago
A calculus of functional BSP programs with projection
Bulk Synchronous Parallel ML (BSML) is an extension of the functional language Objective Caml to program Bulk Synchronous Parallel (BSP) algorithms. It is deterministic, deadlock ...
Frédéric Loulergue
PODS
1994
ACM
138views Database» more  PODS 1994»
14 years 22 days ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman
PPOPP
2006
ACM
14 years 2 months ago
Programming for parallelism and locality with hierarchically tiled arrays
Tiling has proven to be an effective mechanism to develop high performance implementations of algorithms. Tiling can be used to organize computations so that communication costs i...
Ganesh Bikshandi, Jia Guo, Daniel Hoeflinger, Gheo...
ICFP
2012
ACM
11 years 11 months ago
Nested data-parallelism on the gpu
Graphics processing units (GPUs) provide both memory bandwidth and arithmetic performance far greater than that available on CPUs but, because of their Single-Instruction-Multiple...
Lars Bergstrom, John H. Reppy