Sciweavers

117 search results - page 8 / 24
» Run-Time Bytecode Specialization
Sort
View
RANDOM
2001
Springer
14 years 2 months ago
Minimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network Flows
We study integrated prefetching and caching in single and parallel disk systems. A recent approach used linear programming to solve the problem. We show that integrated prefetching...
Susanne Albers, Carsten Witt
IPPS
2000
IEEE
14 years 2 months ago
On Sorting an Intransitive Total Ordered Set Using Semi-Heap
1 The problem of sorting an intransitive total ordered set, a generalization of regular sorting, is considered. This generalized sorting is based on the fact that there exists a s...
Jie Wu
ENTCS
2008
101views more  ENTCS 2008»
13 years 9 months ago
Rewriting Strategies in Java
In any language designed to express transformations, the notion of rewrite rule is a key feature. Its conciseness as well as its strong theoretical foundations are essential. The ...
Emilie Balland, Pierre-Etienne Moreau, Antoine Rei...
HPCN
1997
Springer
14 years 1 months ago
An Application-Level Dependable Technique for Farmer-Worker Parallel Programs
An application-level technique is described for farmer-worker parallel applications which allows a worker to be added or removed from the computing farm at any moment of the run ti...
Vincenzo De Florio, Geert Deconinck, Rudy Lauwerei...
DAC
2008
ACM
14 years 10 months ago
Run-time instruction set selection in a transmutable embedded processor
We are presenting a new concept of an application-specific processor that is capable of transmuting its instruction set according to non-predictive application behavior during run...
Jörg Henkel, Lars Bauer, Muhammad Shafique