Efficient Shared Memory Algorithms for Bounding Space
| dc.contributor.advisor | Woelfel, Philipp | |
| dc.contributor.advisor | Higham, Lisa | |
| dc.contributor.author | Aghazadeh, Zahra | |
| dc.contributor.committeemember | Raynal, Michel | |
| dc.contributor.committeemember | Yanushkevich, Svetlana | |
| dc.contributor.committeemember | Mohassel, Payman | |
| dc.contributor.committeemember | Li, Zongpeng | |
| dc.date | 2018-06 | |
| dc.date.accessioned | 2018-04-27T23:17:26Z | |
| dc.date.available | 2018-04-27T23:17:26Z | |
| dc.date.issued | 2018-04-26 | |
| dc.description.abstract | It is the state of the art that computer systems use multi-core architectures. In order to exploit the benefits of parallelism, multiple processors have to cooperate and concurrently communicate by executing operations on shared objects. It is challenging in shared memory algorithms to deal with the inherent asynchrony of processes. To overcome this difficulty and to achieve high efficiency, algorithm designers often assume unbounded space. This work focuses on designing time-efficient shared memory algorithms while avoiding unbounded space. One example is that of making shared objects writable: Many standard primitives (for instance, compare-and-swap or fetch-and-add) do not provide a Write() operation that unconditionally changes the object's state to the one provided as a parameter. Adding Write() operations without sacrificing efficiency is challenging if space is limited. We provide a space-efficient solution for making synchronization primitives writable with optimal step complexity. A special case of making an object writable is to augment non-resettable objects with Reset() operations. We show how our general transformation can be improved to achieve optimal space implementations of long-lived test-and-set objects with time-efficient Reset() operations. Another example concerns the ABA problem: Even though a process retrieves the same value twice in a row from a shared object, it is still possible that the value of the object has changed multiple times. We investigate the time and space complexity of detecting ABAs in shared memory algorithms for systems with bounded base objects. To that end, we propose a new primitive called an ABA-detecting register, and we give an efficient implementation of this type using asymptotically optimal number of bounded registers. Finally we deal with a more general unbounded space problem: Many applications employ the tagging technique, where shared objects get augmented with additional values, called tags. Unbounded tags are mainly used in those applications, because bounding them is too complicated and error prone. We introduce a new primitive that provides an abstraction for avoiding unbounded tags. Also, we propose optimally time-efficient implementations of this primitive from bounded objects. In addition to straightforward applications that use tags directly, our implementations can also often be used for memory reclamation. | en_US |
| dc.identifier.citation | Aghazadeh, Z. (2018). Efficient Shared Memory Algorithms for Bounding Space (Doctoral thesis, University of Calgary, Calgary, Canada). Retrieved from https://prism.ucalgary.ca. doi:10.11575/PRISM/31853 | en_US |
| dc.identifier.doi | http://dx.doi.org/10.11575/PRISM/31853 | |
| dc.identifier.uri | http://hdl.handle.net/1880/106567 | |
| dc.language.iso | eng | |
| dc.publisher.faculty | Graduate Studies | |
| dc.publisher.faculty | Science | |
| dc.publisher.institution | University of Calgary | en |
| dc.publisher.place | Calgary | en |
| dc.rights | University of Calgary graduate students retain copyright ownership and moral rights for their thesis. You may use this material in any way that is permitted by the Copyright Act or through licensing that has been assigned to the document. For uses that are not allowable under copyright legislation or licensing, you are required to seek permission. | |
| dc.subject | Distributed Computing | |
| dc.subject | Shared Memory | |
| dc.subject | Memory Management | |
| dc.subject | Bounded Space | |
| dc.subject | Writable Objects | |
| dc.subject | Long-Lived Test-And-Set | |
| dc.subject | Tagging | |
| dc.subject | ABA Problem | |
| dc.subject | Distributed Systems | |
| dc.subject | Multi-core | |
| dc.subject | Multi-Thread | |
| dc.subject.classification | Computer Science | en_US |
| dc.title | Efficient Shared Memory Algorithms for Bounding Space | |
| dc.type | doctoral thesis | |
| thesis.degree.discipline | Computer Science | |
| thesis.degree.grantor | University of Calgary | |
| thesis.degree.name | Doctor of Philosophy (PhD) | |
| ucalgary.item.requestcopy | true |