Sciweavers

388 search results - page 31 / 78
» Source-level execution time estimation of C programs
Sort
View
ACTAC
2002
102views more  ACTAC 2002»
13 years 7 months ago
Handling Pointers and Unstructured Statements in the Forward Computed Dynamic Slice Algorithm
Different program slicing methods are used for debugging, testing, reverse engineering and maintenance. Slicing algorithms can be classified as a static slicing or dynamic slicing...
Csaba Faragó, Tamás Gergely
RTAS
1996
IEEE
14 years 15 hour ago
Efficient worst case timing analysis of data caching
Recent progress in worst case timing analysis of programs has made it possible to perform accurate timing analysis of pipelined execution and instruction caching, which is necessa...
Sung-Kwan Kim, Sang Lyul Min, Rhan Ha
ICCS
2005
Springer
14 years 1 months ago
Bulk Synchronous Parallel ML: Modular Implementation and Performance Prediction
Abstract. BSML is a library for parallel programming with the functional language Objective Caml. It is based on an extension of the λcalculus by parallel operations on a parallel...
Frédéric Loulergue, Fréd&eacu...
MM
1995
ACM
89views Multimedia» more  MM 1995»
13 years 11 months ago
A Resolution Independent Video Language
As common as video processing is, programmers still implement video programs as manipulations of arrays of pixels. This paper presents a language extension called Rivl (pronounced...
Jonathan Swartz, Brian C. Smith
ICPPW
2009
IEEE
14 years 2 months ago
Just-in-Time Renaming and Lazy Write-Back on the Cell/B.E.
— Cell Superscalar (CellSs) provides a simple, flexible and easy programming approach for the Cell Broadband Engine (Cell/B.E.) that automatically exploits the inherent concurre...
Pieter Bellens, Josep M. Pérez, Rosa M. Bad...