Sciweavers

217 search results - page 34 / 44
» Data Flow Equations for Explicitly Parallel Programs
Sort
View
137
Voted
CPHYSICS
2006
182views more  CPHYSICS 2006»
15 years 1 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
15 years 7 months 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
15 years 6 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
95
Voted
DAC
1999
ACM
16 years 2 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
136
Voted
CASES
2007
ACM
15 years 5 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