Sciweavers

217 search results - page 2 / 44
» Data Flow Equations for Explicitly Parallel Programs
Sort
View
ISVC
2009
Springer
14 years 5 days ago
Parallel 3D Image Segmentation of Large Data Sets on a GPU Cluster
In this paper, we propose an inherent parallel scheme for 3D image segmentation of large volume data on a GPU cluster. This method originates from an extended Lattice Boltzmann Mod...
Aaron Hagan, Ye Zhao
SASP
2008
IEEE
183views Hardware» more  SASP 2008»
14 years 11 hour ago
Application Acceleration with the Explicitly Parallel Operations System - the EPOS Processor
Different approaches have been proposed over the years for automatically transforming High-Level-Languages (HLL) descriptions of applications into custom hardware implementations. ...
Alexandros Papakonstantinou, Deming Chen, Wen-mei ...
APLAS
2005
ACM
13 years 11 months ago
Transformation to Dynamic Single Assignment Using a Simple Data Flow Analysis
This paper presents a novel method to construct a dynamic single assignment (DSA) form of array-intensive, pointer-free C programs (or in any other procedural language). A program ...
Peter Vanbroekhoven, Gerda Janssens, Maurice Bruyn...
RTS
2002
107views more  RTS 2002»
13 years 5 months ago
Data-Flow Frameworks for Worst-Case Execution Time Analysis
The purpose of this paper is to introduce frameworks based on data-flow equations which provide for estimating the worst-case execution time (WCET) of (real-time) programs. These f...
Johann Blieberger
IPPS
1998
IEEE
13 years 10 months ago
Predicting the Running Times of Parallel Programs by Simulation
Predicting the running time of a parallel program is useful for determining the optimal values for the parameters of the implementation and the optimal mapping of data on processo...
Radu Rugina, Klaus E. Schauser