113 search results - page 2 / 23 » What can the GC compute efficiently |
GC
2004
Springer
13 years 10 months ago
2004
Springer
The DEGAS project aims at enriching standard UML-centred development environments in such a way that the developers of global applications can exploit automated formal analyses wit...
CF
2009
ACM
13 years 11 months ago
2009
ACM
As multithreaded server applications and runtime systems prevail, garbage collection is becoming an essential feature to support high performance systems. The fundamental issue of...
AGP
1994
IEEE
13 years 9 months ago
1994
IEEE
Kowalski and Sergot's Event Calculus (EC) is a formalism for reasoning about time and change in a logic programming framework. From a description of events which occur in the...
ICPPW
2003
IEEE
13 years 10 months ago
2003
IEEE
Gaussian Cubes (GCs) are a family of interconnection topologies in which the interconnection density and algorithmic efficiency are linked by a common parameter, the variation of ...
IPPS
1993
IEEE
13 years 9 months ago
1993
IEEE
Abstract - Parallel algorithms of the hypercube allocation strategies are considered in this paper. Although the sequential algorithms of various hypercube allocation strategies ar...