rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    non sort: A
    title: concurrency and time centered framework for certification of autonomous space systems
  name:
    name part: Dechev, Damian.
    role:
      role term: creator
  name:
    name part: Stroustrup, Bjarne
    role:
      role term: thesis advisor.
  type of resource: text
  genre: bibliography
  origin info:
    place:
      place term: txu
    date issued: 2010
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: remote
    extent: 1 online resource.
  abstract: Future space missions, such as Mars Science Laboratory, suggest the engineering of some of the most complex man-rated autonomous software systems. The present process-oriented certification methodologies are becoming prohibitively expensive and do not reach the level of detail of providing guidelines for the development and validation of concurrent software. Time and concurrency are the most critical notions in an autonomous space system. In this work we present the design and implementation of the first concurrency and time centered framework for product-oriented software certification of autonomous space systems. To achieve fast and reliable concurrent interactions, we define and apply the notion of Semantically Enhanced Containers (SEC). SECs are data structures that are designed to provide the flexibility and usability of the popular ISO C++ STL containers, while at the same time they are hand-crafted to guarantee domain-specific policies, such as conformance to a given concurrency model. The application of nonblocking programming techniques is critical to the implementation of our SEC containers. Lock-free algorithms help avoid the hazards of deadlock, livelock, and priority inversion, and at the same time deliver fast and scalable performance. Practical lock-free algorithms are notoriously difficult to design and implement and pose a number of hard problems such as ABA avoidance, high complexity, portability, and meeting the linearizability correctness requirements. This dissertation presents the design of the first lock-free dynamically resizable array. Our approach o ers a set of practical, portable, lock-free, and linearizable STL vector operations and a fast and space effcient implementation when compared to the alternative lock- and STM-based techniques. Currently, the literature does not offer an explicit analysis of the ABA problem, its relation to the most commonly applied nonblocking programming techniques, and the possibilities for its detection and …
  note: by Damian Dechev.
  note: "Major Subject: Computer Science"
  note: Title from author supplied metadata (automated record created 2010-08-20 08:31:34).
  note: Electronic resource.
  note: Doctor of Philosophy Texas A&M University 2009 http://hdl.handle.net/1969.1/ETD-TAMU-2009-12-7333
  note: Includes bibliographical references.
  note: Text (Dissertation)
  subject:
    topic: Major computer science
  subject:
    topic: Model-based Design
  subject:
    topic: Priority Inversion
  subject:
    topic: ABA Problem
  subject:
    topic: Constant-time Dynamic Cast
  subject:
    topic: C++ Programming Techniques and Tools
  subject:
    topic: Real-time Embedded C++
  subject:
    topic: Lock-free Programming
  identifier: http://hdl.handle.net/1969.1/ETD-TAMU-2009-12-7333
  record info:
    record content source: TXA
    record creation date: 100903
    record change date: 20151201155000.0
    record identifier: in00002619043