Sciweavers

150 search results - page 13 / 30
» A Calculus for Relaxed Memory
Sort
View
ICML
1997
IEEE
15 years 11 months ago
Predicting Multiprocessor Memory Access Patterns with Learning Models
Machine learning techniques are applicable to computer system optimization. We show that shared memory multiprocessors can successfully utilize machine learning algorithms for mem...
M. F. Sakr, Steven P. Levitan, Donald M. Chiarulli...
ESOP
2008
Springer
15 years 13 days ago
Typing Safe Deallocation
In this work we address the problem of proving, by static analysis means, that allocating and deallocating regions in the store provides a safe way to achieve memory management. Th...
Gérard Boudol
ECOOP
2010
Springer
15 years 3 months ago
Reasoning about the Implementation of Concurrency Abstractions on x86-TSO
ncy Abstractions on x86-TSO Scott Owens University of Cambridge Abstract. With the rise of multi-core processors, shared-memory concurrency has become a widespread feature of compu...
Scott Owens
IEEEPACT
2005
IEEE
15 years 4 months ago
Communication Optimizations for Fine-Grained UPC Applications
Global address space languages like UPC exhibit high performance and portability on a broad class of shared and distributed memory parallel architectures. The most scalable applic...
Wei-Yu Chen, Costin Iancu, Katherine A. Yelick
DATE
2003
IEEE
122views Hardware» more  DATE 2003»
15 years 4 months ago
A General Framework for Analysing System Properties in Platform-Based Embedded System Designs
We present a framework (Real-Time Calculus) for analysing various system properties pertaining to timing analysis, loads on various components and on-chip buffer memory requiremen...
Samarjit Chakraborty, Simon Künzli, Lothar Th...