Sciweavers

370 search results - page 31 / 74
» Run-Time Support for Distributed Sharing in Typed Languages
Sort
View
ICDT
2001
ACM
147views Database» more  ICDT 2001»
14 years 1 days ago
Parallelizing the Data Cube
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambr...
IWMM
1998
Springer
153views Hardware» more  IWMM 1998»
13 years 11 months ago
Compiler Support to Customize the Mark and Sweep Algorithm
Mark and sweep garbage collectors (GC) are classical but still very efficient automatic memory management systems. Although challenged by other kinds of systems, such as copying c...
Dominique Colnet, Philippe Coucaud, Olivier Zendra
IADIS
2009
13 years 5 months ago
Rendezvous-based associations: Language abstractions for robot collaboration
IONS FOR ROBOT COLLABORATION Bent Bruun Kristensen Maersk Mc-Kinney Moller Institute, University of Southern Denmark Campusvej 55, DK-5230, Odense M, Denmark Collaboration between...
Bent Bruun Kristensen
OOPSLA
2007
Springer
14 years 1 months ago
Component nextgen: a sound and expressive component framework for java
Developing a general component system for a statically typed, object-oriented language is a challenging design problem for two reasons. First, mutually recursive references across...
James Sasitorn, Robert Cartwright
PLDI
2003
ACM
14 years 25 days ago
A provably sound TAL for back-end optimization
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
Juan Chen, Dinghao Wu, Andrew W. Appel, Hai Fang