Sciweavers

8132 search results - page 225 / 1627
» Dependability, Abstraction, and Programming
Sort
View
TPDS
1998
157views more  TPDS 1998»
15 years 6 months ago
A Compiler Optimization Algorithm for Shared-Memory Multiprocessors
This paper presents a new compiler optimization algorithm that parallelizes applications for symmetric, sharedmemory multiprocessors. The algorithm considers data locality, parall...
Kathryn S. McKinley
TOOLS
1999
IEEE
15 years 11 months ago
Communication as a Means to Differentiate Objects, Components and Agents
the right abstractions is important for managing the complexity of your system. Three t abstractions used today are object, component and agent. Many similarities exist these abst...
Dwight Deugo, Franz Oppacher, Bruce Ashfield, Mich...
APLAS
2004
ACM
16 years 1 days ago
D-Fusion: A Distinctive Fusion Calculus
Abstract. Fusion calculus is commonly regarded as a generalisation of pi. Actually, we prove that there is no uniform fully abstract embedding
Michele Boreale, Maria Grazia Buscemi, Ugo Montana...
SAS
2010
Springer
140views Formal Methods» more  SAS 2010»
15 years 5 months ago
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
Christophe Alias, Alain Darte, Paul Feautrier, Lau...
IPPS
2003
IEEE
15 years 12 months ago
Applying Aspect-Orient Programming Concepts to a Component-Based Programming Model
Abstract— The execution environments For scientific applications have evolved significantly over the years. Vector and parallel architectures have provided significantly faste...
Thomas Eidson, Jack Dongarra, Victor Eijkhout