Implementation Techniques for Variational Data Structures Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/1831cq46w

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • Many applications require not only representing variability in software and data, butalso computing with it. To do so efficiently requires variational data structures thatmake variability explicit in the underlying data and the operations used to manipulate it.Variational data structures have been developed ad hoc for many applications, but thereis little general understanding of how to design them or what tradeoffs exist among them.In this thesis, we introduce the concept of holes to represent variational data structuresof different sizes and shapes. Moreover, we strive for a more systematic exploration andanalysis of a variational data structure. We want to know how different design decisionsaffect the performance and scalability of a variational data structure, and what propertiesof the underlying data and operation sequences need to be considered.Specifically, we study several alternative designs of a variational stack and analyze howthese design decisions affect the performance of a variational stack with different usageprofiles. We evaluate variational stacks in a real-world scenario: in the interpreter VarexJwhen executing real software containing variability. Finally, we discuss different ways ofrepresenting variational priority queues and show how this affects the performance of thevariational Dijkstra’s algorithm.
License
Resource Type
Date Available
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Committee Member
Academic Affiliation
Non-Academic Affiliation
Rights Statement
Publisher
Peer Reviewed
Language
Replaces
Additional Information
  • description.provenance : Approved for entry into archive by Julie Kurtz(julie.kurtz@oregonstate.edu) on 2017-11-06T21:22:27Z (GMT) No. of bitstreams: 2license_rdf: 1379 bytes, checksum: da3654ba11642cda39be2b66af335aae (MD5)Meng2018.pdf: 1607308 bytes, checksum: b89bf6394b5b028f2b5da50c113aadc0 (MD5)
  • description.provenance : Made available in DSpace on 2017-11-15T19:05:55Z (GMT). No. of bitstreams: 2license_rdf: 1379 bytes, checksum: da3654ba11642cda39be2b66af335aae (MD5)Meng2018.pdf: 1607308 bytes, checksum: b89bf6394b5b028f2b5da50c113aadc0 (MD5)
  • description.provenance : Submitted by Meng Meng (mengmeng2811@gmail.com) on 2017-11-03T07:04:03ZNo. of bitstreams: 2license_rdf: 1379 bytes, checksum: da3654ba11642cda39be2b66af335aae (MD5)Meng2018.pdf: 1607308 bytes, checksum: b89bf6394b5b028f2b5da50c113aadc0 (MD5)
  • description.provenance : Approved for entry into archive by Steven Van Tuyl(steve.vantuyl@oregonstate.edu) on 2017-11-15T19:05:55Z (GMT) No. of bitstreams: 2license_rdf: 1379 bytes, checksum: da3654ba11642cda39be2b66af335aae (MD5)Meng2018.pdf: 1607308 bytes, checksum: b89bf6394b5b028f2b5da50c113aadc0 (MD5)

Relationships

Parents:

This work has no parents.

Last modified

Downloadable Content

Download PDF

Items