Sciweavers

2656 search results - page 5 / 532
» Design and analysis of algorithms reconsidered
Sort
View
ACSC
2008
IEEE
16 years 7 days ago
Reasoning about inherent parallelism in modern object-oriented languages
In the future, if we are to continue to expect improved application performance we will have to achieve it by exploiting course-grained hardware parallelism rather then simply rel...
Wayne Reid, Wayne Kelly, Andrew Craik
NJC
2006
125views more  NJC 2006»
15 years 5 months ago
PRO: A Model for the Design and Analysis of Efficient and Scalable Parallel Algorithms
Abstract. We present a new parallel computation model called the Parallel ResourceOptimal computation model. PRO is a framework being proposed to enable the design of efficient and...
Assefaw Hadish Gebremedhin, Mohamed Essaïdi, ...
ICPP
1993
IEEE
15 years 10 months ago
Dependence Analysis and Architecture Design for Bit-Level Algorithms
:. In designing application-specific bit-level architectures and in programming existing bit-level processor arrays, it is necessary to expand a word-level algorithm into its bit-...
Weijia Shang, Benjamin W. Wah
163
Voted
DISOPT
2007
155views more  DISOPT 2007»
15 years 5 months ago
Linear-programming design and analysis of fast algorithms for Max 2-CSP
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
Alexander D. Scott, Gregory B. Sorkin
DSN
2005
IEEE
15 years 11 months ago
Design Time Reliability Analysis of Distributed Fault Tolerance Algorithms
Designing a distributed fault tolerance algorithm requires careful analysis of both fault models and diagnosis strategies. A system will fail if there are too many active faults, ...
Elizabeth Latronico, Philip Koopman