Sciweavers

1448 search results - page 83 / 290
» Restricted Stack Implementations
Sort
View
CC
2001
Springer
121views System Software» more  CC 2001»
14 years 6 days ago
Constant-Time Root Scanning for Deterministic Garbage Collection
Root scanning is the task of identifying references to heap objects that are stored outside of the heap itself, in global and local variables and on the execution stack. Root scann...
Fridtjof Siebert
ICLP
2001
Springer
14 years 5 days ago
On a Tabling Engine That Can Exploit Or-Parallelism
Tabling is an implementation technique that improves the declarativeness and expressiveness of Prolog by reusing solutions to goals. Quite a few interesting applications of tabling...
Ricardo Rocha, Fernando M. A. Silva, Vítor ...
PLDI
1999
ACM
14 years 22 hour ago
Pointer Analysis for Multithreaded Programs
This paper presents a novel interprocedural, ow-sensitive, and context-sensitive pointer analysis algorithm for multithreaded programs that may concurrently update shared pointers...
Radu Rugina, Martin C. Rinard
EUROPAR
1999
Springer
13 years 12 months ago
DAOS - Scalable And-Or Parallelism
Abstract. This paper presents DAOS, a model for exploitation of Andand Or-parallelism in logic programs. DAOS assumes a physically distributed memory environment and a logically sh...
Luís Fernando Castro, Vítor Santos C...
VVS
1996
IEEE
202views Visualization» more  VVS 1996»
13 years 12 months ago
Direct Volume Rendering with Shading via Three-Dimensional Textures
A new and easy-to-implement method for direct volume rendering that uses 3D texture maps for acceleration, and incorporates directional lighting, is described. The implementation,...
Allen Van Gelder, Kwansik Kim