Supporting lock‐based multiprocessor resource sharing protocols in real‐time programming languages. (20th June 2012)

• Record Type: Journal Article
• Authors: Lin, Shiyao; Wellings, Andy; Burns, Alan
• Other Names: Ravn Anders P. guestEditor.; Higuera‐Toledano M. Teresa guestEditor.; Porto Fabio guestEditor.; Schulze Bruno guestEditor.
• Is Part Of: Concurrency and computation. Volume 25:Number 16(2013:Nov.)
• Page Start: 2227
• Page End: 2251
• Publication Date: 2012-06-20
• Subjects: real‐time programming -- lock‐based synchronization -- multiprocessor; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.2882
• Languages: English
• ISSNs: 1532-0626

Abstract

SUMMARY: Lock‐based resource sharing protocols for single processor systems are well understood and supported in programming languages such as Ada and the Real‐Time Specification for Java, and in Real‐Time Operating Systems, such as those that conform to the Real‐Time POSIX standard. In contrast, multiprocessor resource sharing protocols are still in their infancy with no agreed best practices, and yet current real‐time programming languages and operating systems claim to be suitable for multiprocessor applications. This paper reviews the currently available multiprocessor resource allocation policies and analyzes their applicability to the main industry standard real‐time programming languages. It then proposes a framework that allows programmers to define and implement their own locking policy. A prototype implementation of the framework for Ada is presented and evaluated. Copyright © 2012 John Wiley & Sons, Ltd.