Sciweavers

217 search results - page 34 / 44
» Data Flow Equations for Explicitly Parallel Programs
Sort
View
CPHYSICS
2006
182views more  CPHYSICS 2006»
13 years 7 months ago
MinFinder: Locating all the local minima of a function
A new stochastic clustering algorithm is introduced that aims to locate all the local minima of a multidimensional continuous and differentiable function inside a bounded domain. ...
Ioannis G. Tsoulos, Isaac E. Lagaris
EUROPAR
2005
Springer
14 years 28 days ago
Tolerating Message Latency Through the Early Release of Blocked Receives
Large message latencies often lead to poor performance of parallel applications. In this paper, we investigate a latency-tolerating technique that immediately releases all blocking...
Jian Ke, Martin Burtscher, William Evan Speight
IEEEPACT
2000
IEEE
13 years 11 months ago
Global Register Partitioning
Modern computers have taken advantage of the instruction-level parallelism (ILP) available in programs with advances in both architecture and compiler design. Unfortunately, large...
Jason Hiser, Steve Carr, Philip H. Sweany
DAC
1999
ACM
14 years 8 months ago
Constraint Driven Code Selection for Fixed-Point DSPs
Abstract? Fixed-point DSPs are a class of embedded processors with highly irregular architectures. This irregularity makes it difficult to generate high-quality machine code from p...
Steven Bashford, Rainer Leupers
CASES
2007
ACM
13 years 11 months ago
Application driven embedded system design: a face recognition case study
The key to increasing performance without a commensurate increase in power consumption in modern processors lies in increasing both parallelism and core specialization. Core speci...
Karthik Ramani, Al Davis