Sciweavers

1236 search results - page 226 / 248
» Efficient Interpretation Policies
Sort
View
WOSP
2000
ACM
13 years 12 months ago
Expressing meaningful processing requirements among heterogeneous nodes in an active network
Active Network technology envisions deployment of virtual execution environments within network elements, such as switches and routers. As a result, nonhomogeneous processing can ...
Virginie Galtier, Kevin L. Mills, Yannick Carlinet...
IPPS
1998
IEEE
13 years 11 months ago
Benchmarking the Task Graph Scheduling Algorithms
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
Yu-Kwong Kwok, Ishfaq Ahmad
SIGGRAPH
1996
ACM
13 years 11 months ago
Light Field Rendering
A number of techniques have been proposed for flying through scenes by redisplaying previously rendered or digitized views. Techniques have also been proposed for interpolating be...
Marc Levoy, Pat Hanrahan
DLS
2007
150views Languages» more  DLS 2007»
13 years 11 months ago
RPython: a step towards reconciling dynamically and statically typed OO languages
Although the C-based interpreter of Python is reasonably fast, implementations on the CLI or the JVM platforms offers some advantages in terms of robustness and interoperability. ...
Davide Ancona, Massimo Ancona, Antonio Cuni, Nicho...
EMSOFT
2006
Springer
13 years 11 months ago
Modeling a system controller for timing analysis
Upper bounds on worst-case execution times, which are commonly called WCET, are a prerequisite for validating the temporal correctness of tasks in a real-time system. Due to the e...
Stephan Thesing