scholarly journals Fence Placement for Legacy Data-Race-Free Programs via Synchronization Read Detection

2016 ◽  
Vol 12 (4) ◽  
pp. 1-23
Author(s):  
Andrew J. Mcpherson ◽  
Vijay Nagarajan ◽  
Susmit Sarkar ◽  
Marcelo Cintra
Keyword(s):  
Data Race ◽  
Legacy Data

scholarly journals Fence placement for legacy data-race-free programs via synchronization read detection

2015 ◽  
Vol 50 (8) ◽  
pp. 249-250
Author(s):  
Andrew J. McPherson ◽  
Vijay Nagarajan ◽  
Susmit Sarkar ◽  
Marcelo Cintra
Keyword(s):  
Data Race ◽  
Legacy Data

Symbolic data race detection for Habanero programs

2019 ◽  
Vol 44 (4) ◽  
pp. 18-18 ◽  
Author(s):  
Egor Namakonov ◽  
Eric Mercer ◽  
Pavel Parizek ◽  
Kyle Storey
Keyword(s):  
Data Race ◽  
Data Race Detection ◽  
Race Detection ◽  
Symbolic Data

CONSTRUCTING THE ‘URBAN PROFILE’ OF AN ANCIENT GREEK CITY: EVIDENCE FROM THE OLYNTHOS PROJECT

2020 ◽  
Vol 115 ◽  
pp. 329-378
Author(s):  
Lisa C. Nevett ◽  
E. Bettina Tsigarida ◽  
Zosia H. Archibald ◽  
David L. Stone ◽  
Bradley A. Ault ◽  
...  
Keyword(s):  
Urban Infrastructure ◽  
Holistic Approach ◽  
Data Sets ◽  
Ancient Greek ◽  
Greek City ◽  
Classical Greece ◽  
Relevant Evidence ◽  
Classical Studies ◽  
Legacy Data ◽  
Greek World

This article argues that a holistic approach to documenting and understanding the physical evidence for individual cities would enhance our ability to address major questions about urbanisation, urbanism, cultural identities and economic processes. At the same time we suggest that providing more comprehensive data-sets concerning Greek cities would represent an important contribution to cross-cultural studies of urban development and urbanism, which have often overlooked relevant evidence from Classical Greece. As an example of the approach we are advocating, we offer detailed discussion of data from the Archaic and Classical city of Olynthos, in the Halkidiki. Six seasons of fieldwork here by the Olynthos Project, together with legacy data from earlier projects by the American School of Classical Studies at Athens and by the Greek Archaeological Service, combine to make this one of the best-documented urban centres surviving from the Greek world. We suggest that the material from the site offers the potential to build up a detailed ‘urban profile’, consisting of an overview of the early development of the community as well as an in-depth picture of the organisation of the Classical settlement. Some aspects of the urban infrastructure can also be quantified, allowing a new assessment of (for example) its demography. This article offers a sample of the kinds of data available and the sorts of questions that can be addressed in constructing such a profile, based on a brief summary of the interim results of fieldwork and data analysis carried out by the Olynthos Project, with a focus on research undertaken during the 2017, 2018 and 2019 seasons.

scholarly journals Correct program parallelisations

2021 ◽  
Author(s):  
S. Blom ◽  
S. Darabi ◽  
M. Huisman ◽  
M. Safari
Keyword(s):  
Composition Operators ◽  
Parallel Programs ◽  
Parallel Program ◽  
Tool Support ◽  
Intermediate Representation ◽  
Data Race ◽  
Sequential Program ◽  
Functional Correctness ◽  
Correct Program ◽  
Basic Blocks

AbstractA commonly used approach to develop deterministic parallel programs is to augment a sequential program with compiler directives that indicate which program blocks may potentially be executed in parallel. This paper develops a verification technique to reason about such compiler directives, in particular to show that they do not change the behaviour of the program. Moreover, the verification technique is tool-supported and can be combined with proving functional correctness of the program. To develop our verification technique, we propose a simple intermediate representation (syntax and semantics) that captures the main forms of deterministic parallel programs. This language distinguishes three kinds of basic blocks: parallel, vectorised and sequential blocks, which can be composed using three different composition operators: sequential, parallel and fusion composition. We show how a widely used subset of OpenMP can be encoded into this intermediate representation. Our verification technique builds on the notion of iteration contract to specify the behaviour of basic blocks; we show that if iteration contracts are manually specified for single blocks, then that is sufficient to automatically reason about data race freedom of the composed program. Moreover, we also show that it is sufficient to establish functional correctness on a linearised version of the original program to conclude functional correctness of the parallel program. Finally, we exemplify our approach on an example OpenMP program, and we discuss how tool support is provided.

Sign in / Sign up

Export Citation Format

Share Document