Sciweavers

108 search results - page 6 / 22
» Compactly representing parallel program executions
Sort
View
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
14 years 2 months ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki
LCPC
1991
Springer
14 years 2 days ago
An Executable Representation of Distance and Direction
The dependence ow graph is a novel intermediate representation for optimizingand parallelizing compilersthat can be viewed as an executable representation of program dependences. ...
Richard Johnson, Wei Li, Keshav Pingali
DATE
2010
IEEE
184views Hardware» more  DATE 2010»
14 years 1 months ago
Parallel subdivision surface rendering and animation on the Cell BE processor
—Subdivision Surfaces provide a compact way to describe a smooth surface using a mesh model. They are widely used in 3D animation and nearly all modern modeling programs support ...
R. Grottesi, S. Morigi, Martino Ruggiero, Luca Ben...
ICS
1992
Tsinghua U.
14 years 19 days ago
The CODE 2.0 graphical parallel programming language
CODE 2.0 is a graphical parallel programming system that targets the three goals of ease of use, portability, and production of efficient parallel code. Ease of use is provided by...
Peter Newton, James C. Browne
CLUSTER
2007
IEEE
14 years 2 months ago
Non-collective parallel I/O for global address space programming models
— Achieving high performance for out-of-core applications typically involves explicit management of the movement of data between the disk and the physical memory. We are developi...
Sriram Krishnamoorthy, Juan Piernas, Vinod Tippara...