Sciweavers

1933 search results - page 175 / 387
» High-performance computing using accelerators
Sort
View
ICPP
2005
IEEE
14 years 4 months ago
Incremental Parallelization Using Navigational Programming: A Case Study
We show how a series of transformations can be applied to a sequential program to obtain programs that represent successive steps in exploiting parallelism in the original algorit...
Lei Pan, Wenhui Zhang, Arthur Asuncion, Ming Kin L...
SIGGRAPH
2000
ACM
14 years 3 months ago
Conservative volumetric visibility with occluder fusion
Visibility determination is a key requirement in a wide range of graphics algorithms. This paper introduces a new approach to the computation of volume visibility, the detection o...
Gernot Schaufler, Julie Dorsey, Xavier Déco...
FCCM
2011
IEEE
241views VLSI» more  FCCM 2011»
13 years 2 months ago
Multilevel Granularity Parallelism Synthesis on FPGAs
— Recent progress in High-Level Synthesis (HLS) es has helped raise the abstraction level of FPGA programming. However implementation and performance evaluation of the HLS-genera...
Alexandros Papakonstantinou, Yun Liang, John A. St...
IPPS
2010
IEEE
13 years 8 months ago
How Algorithm Definition Language (ADL) improves the performance of SmartGridSolve applications
In this paper, we study the importance of languages for the specification of algorithms in high performance Grid computing. We present one such language, the Algorithm Definition ...
Michele Guidolin, Thomas Brady, Alexey L. Lastovet...
ASPLOS
2010
ACM
14 years 5 months ago
Conservation cores: reducing the energy of mature computations
Growing transistor counts, limited power budgets, and the breakdown of voltage scaling are currently conspiring to create a utilization wall that limits the fraction of a chip tha...
Ganesh Venkatesh, Jack Sampson, Nathan Goulding, S...