2019 search results - page 37 / 404 » Programming with Shared Data Abstractions |
TJS
1998
13 years 7 months ago
1998
Management of program data to improve data locality and reduce false sharing is critical for scaling performanceon NUMA shared memorymultiprocessors. We use HPF-like data decomposi...
FSTTCS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Conventional semantics for shared-variable concurrency suffers from the “grain of time” problem, i.e., the necessity of specifying a default level of atomicity. We pr...
AGP
1997
IEEE
13 years 12 months ago
1997
IEEE
Although the usual goal of sharing analysis is to detect which pairs of variables share, the standard choice for sharing analysis is a domain that characterizes setsharing. In thi...
OOPSLA
2010
Springer
13 years 5 months ago
2010
Springer
In this paper we propose a communication-centric approach to specifying and checking how multithreaded programs use shared memory to perform inter-thread communication. Our approa...
IPPS
1999
IEEE
13 years 12 months ago
1999
IEEE
Abstract. This paper uses a theory of composition based on existential and universal properties. Universal properties are useful to describe components interactions through shared ...