國立虎尾科技大學 |

Holistic Consistency Models for Faster Applications and Systems.

紀錄類型:	書目-語言資料,手稿 : Monograph/item
正題名/作者:	Holistic Consistency Models for Faster Applications and Systems./
作者:	Helt, Jeffrey Maxwell.
面頁冊數:	1 online resource (170 pages)
附註:	Source: Dissertations Abstracts International, Volume: 85-10, Section: B.
Contained By:	Dissertations Abstracts International85-10B.
標題:	Computer science. -
電子資源:	click for full text (PQDT)
ISBN:	9798382191324

Holistic Consistency Models for Faster Applications and Systems.
Helt, Jeffrey Maxwell.

Holistic Consistency Models for Faster Applications and Systems. - 1 online resource (170 pages)

Source: Dissertations Abstracts International, Volume: 85-10, Section: B.

Thesis (Ph.D.)--Princeton University, 2024.

Includes bibliographical references

The correctness and performance of today's applications are heavily influenced by the consistency models of their supporting services. Strong consistency models, like strict serializability and linearizability, restrict the space of possible service behaviors and in turn, simplify application programming.In exchange for their strong guarantees, however, strictly serializable and linearizable services incur worse performance than those with weaker consistency. But switching to such services can break applications. Consistency models thus offer a harsh trade-off between application correctness and service performance.Despite impacting both applications and services, most existing work on consistency models has taken a limited view. A long line of research sought to weaken the consistency of common services in an effort to improve their performance, largely without considering the impacts of weaker consistency on application correctness. A separate line of work investigated the impacts of weaker consistency on applications. In contrast, this dissertation takes a holistic approach, considering applications and services together to develop better consistency models. First, we introduce Regular Sequential Serializability (RSS) and Regular Sequential Consistency (RSC). They are respectively as strong as strict serializability and linearizability for applications: we prove any application that is correct when using a strictly serializable (respectively linearizable) service is also correct when using an RSS (RSC) service. And yet, they enable new, better-performing services, thus circumventing the correctness-performance trade-off. To demonstrate the latter, we design, implement, and evaluate variants of two systems, Spanner-RSS and Gryff-RSC. The variants achieve lower tail read latency than their existing counterparts.Second, we introduce Multi-dispatch Linearizability (MD-Linearizability), which relaxes linearizability's assumption that a client is sequential and instead explicitly allows it to issue multiple operations concurrently. This can help reduce an application's end-to-end latency. To this end, we present Ellis, the first multi-shard system to guarantee MD-Linearizability, and show it reduces end-to-end application latency by up to 75%. Importantly, we also describe how to rewrite applications built atop linearizable services into ones that interact with comparable MD-Linearizable services. Following the transformation ensures the new applications behave identically to the originals, so programmers can reap MD-Linearizability's performance benefits without worrying about breaking their applications.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2024

Mode of access: World Wide Web

ISBN: 9798382191324Subjects--Topical Terms:

573171
Computer science.
Subjects--Index Terms:

Consistency modelsIndex Terms--Genre/Form:

554714
Electronic books.

Holistic Consistency Models for Faster Applications and Systems.
LDR:04022ntm a22003977 4500 001 1151697
005 20241118085737.5
006 m o d
007 cr mn ---uuuuu
008 250605s2024 xx obm 000 0 eng d
020 $a 9798382191324
035 $a (MiAaPQ)AAI30993332
035 $a AAI30993332
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Helt, Jeffrey Maxwell. $3 1478511
245 1 0 $a Holistic Consistency Models for Faster Applications and Systems.
264 0 $c 2024
300 $a 1 online resource (170 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertations Abstracts International, Volume: 85-10, Section: B.
500 $a Advisor: Lloyd, Wyatt.
502 $a Thesis (Ph.D.)--Princeton University, 2024.
504 $a Includes bibliographical references
520 $a The correctness and performance of today's applications are heavily influenced by the consistency models of their supporting services. Strong consistency models, like strict serializability and linearizability, restrict the space of possible service behaviors and in turn, simplify application programming.In exchange for their strong guarantees, however, strictly serializable and linearizable services incur worse performance than those with weaker consistency. But switching to such services can break applications. Consistency models thus offer a harsh trade-off between application correctness and service performance.Despite impacting both applications and services, most existing work on consistency models has taken a limited view. A long line of research sought to weaken the consistency of common services in an effort to improve their performance, largely without considering the impacts of weaker consistency on application correctness. A separate line of work investigated the impacts of weaker consistency on applications. In contrast, this dissertation takes a holistic approach, considering applications and services together to develop better consistency models. First, we introduce Regular Sequential Serializability (RSS) and Regular Sequential Consistency (RSC). They are respectively as strong as strict serializability and linearizability for applications: we prove any application that is correct when using a strictly serializable (respectively linearizable) service is also correct when using an RSS (RSC) service. And yet, they enable new, better-performing services, thus circumventing the correctness-performance trade-off. To demonstrate the latter, we design, implement, and evaluate variants of two systems, Spanner-RSS and Gryff-RSC. The variants achieve lower tail read latency than their existing counterparts.Second, we introduce Multi-dispatch Linearizability (MD-Linearizability), which relaxes linearizability's assumption that a client is sequential and instead explicitly allows it to issue multiple operations concurrently. This can help reduce an application's end-to-end latency. To this end, we present Ellis, the first multi-shard system to guarantee MD-Linearizability, and show it reduces end-to-end application latency by up to 75%. Importantly, we also describe how to rewrite applications built atop linearizable services into ones that interact with comparable MD-Linearizable services. Following the transformation ensures the new applications behave identically to the originals, so programmers can reap MD-Linearizability's performance benefits without worrying about breaking their applications.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2024
538 $a Mode of access: World Wide Web
650 4 $a Computer science. $3 573171
650 4 $a Computer engineering. $3 569006
650 4 $a Information technology. $3 559429
653 $a Consistency models
653 $a Databases
653 $a Distributed systems
653 $a Multi-shard system
653 $a Multi-dispatch Linearizability
655 7 $a Electronic books. $2 local $3 554714
690 $a 0984
690 $a 0464
690 $a 0489
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a Princeton University. $b Computer Science. $3 1179801
773 0 $t Dissertations Abstracts International $g 85-10B.
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=30993332 $z click for full text (PQDT)