Sciweavers

69 search results - page 3 / 14
» Efficient Dynamic Scheduling Through Tag Elimination
Sort
View
LFP
1992
140views more  LFP 1992»
13 years 6 months ago
Global Tagging Optimization by Type Inference
Tag handling accounts for a substantial amount of execution cost in latently typed languages such as Common LISP and Scheme, especially on architectures that provide no special ha...
Fritz Henglein
AIPS
2008
13 years 7 months ago
Fast Dynamic Scheduling of Disjunctive Temporal Constraint Networks through Incremental Compilation
Autonomous systems operating in real-world environments must plan, schedule, and execute missions while robustly adapting to uncertainty and disturbance. One way to mitigate the e...
Julie A. Shah, Brian C. Williams
ASPLOS
1992
ACM
13 years 9 months ago
Efficient Superscalar Performance Through Boosting
The foremost goal of superscalar processor design is to increase performance through the exploitation of instruction-level parallelism (ILP). Previous studies have shown that spec...
Michael D. Smith, Mark Horowitz, Monica S. Lam
ESORICS
2009
Springer
14 years 5 months ago
Enabling Public Verifiability and Data Dynamics for Storage Security in Cloud Computing
Cloud Computing has been envisioned as the next-generation architecture of IT Enterprise. It moves the application software and databases to the centralized large data centers, whe...
Qian Wang, Cong Wang, Jin Li, Kui Ren, Wenjing Lou
SEC
2000
13 years 6 months ago
Improving Packet Filters Management through Automatic and Dynamic Schemes
: The development of complex access control architectures raises the problem of their management. In this article, we describe an architecture providing packet filters configuratio...
Olivier Paul, Maryline Laurent