Sciweavers

168 search results - page 10 / 34
» Making Applications Persistent at Run-time
Sort
View
ICPADS
2008
IEEE
14 years 1 months ago
Parallel Large Scale Inference of Protein Domain Families
The resolution of combinatorial assortments of protein sequences into domains is a prerequisite for protein sequence interpretation. However the recognition and clustering of homo...
Daniel Kahn, Clément Rezvoy, Fréd&ea...
IPPS
1999
IEEE
13 years 11 months ago
Dynamic Application Structuring on Heterogeneous, Distributed Systems
The diversity of computers and networks within a distributed system makes these systems highly heterogeneous. System heterogeneity complicates the design of static applications tha...
Saurav Chatterjee
22
Voted
SC
2005
ACM
14 years 28 days ago
Scalable Parallel Octree Meshing for TeraScale Applications
We present a new methodology for generating and adapting octree meshes for terascale applications. Our approach combines existing methods, such as parallel octree decomposition and...
Tiankai Tu, David R. O'Hallaron, Omar Ghattas
APLAS
2010
ACM
13 years 5 months ago
Live Heap Space Bounds for Real-Time Systems
Live heap space analyses have so far been concerned with the standard sequential programming model. However, that model is not very well suited for embedded real-time systems, wher...
Martin Kero, Pawel Pietrzak, Johan Nordlander
POS
2000
Springer
13 years 11 months ago
TMOS: A Transactional Garbage Collector
Abstract. Defining persistence in terms of reachability is fundamental to achieving orthogonality of persistence. It is implicit to the principles of orthogonal persistence and is ...
John N. Zigman, Stephen Blackburn, J. Eliot B. Mos...