Sciweavers

10890 search results - page 134 / 2178
» Automatic Complexity Analysis
Sort
View
ISPW
2005
IEEE
15 years 12 months ago
Automatically Analyzing Software Processes: Experience Report
Sound methods of analysis and comparison of software processes are crucial for such tasks as process understanding, process correctness verification, evolution management, proces...
Rodion M. Podorozhny, Dewayne E. Perry, Leon J. Os...
PPOPP
1999
ACM
15 years 10 months ago
Automatic Parallelization of Divide and Conquer Algorithms
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
Radu Rugina, Martin C. Rinard
TJS
2002
101views more  TJS 2002»
15 years 6 months ago
Compilation for Adaptive Computing Systems Using Complex Parameterized Hardware Objects
FLAME, the Flexible API for Module-based Environments, is a proposed standard interface for the integration of parameterized hardware generators into high-level design tools. This ...
Andreas Koch
ESCIENCE
2006
IEEE
15 years 10 months ago
Designing Workflow Components for e-Science
In this paper we present a general domain for the analysis of workflows and workflow components based on the notion of a collection of Turing machines sharing a set of tapes. We s...
Frank Terpstra, Pieter W. Adriaans
WADS
2001
Springer
182views Algorithms» more  WADS 2001»
15 years 10 months ago
On the Complexity of Scheduling Conditional Real-Time Code
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
Samarjit Chakraborty, Thomas Erlebach, Lothar Thie...