東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Linked to FindBook

Google Book

Amazon

博客來

Towards Ubiquitous Serverless Computing: Fast Large-Scale Machine Learning and Optimal Pricing for the Cloud.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Towards Ubiquitous Serverless Computing: Fast Large-Scale Machine Learning and Optimal Pricing for the Cloud./
Author:	Gupta, Vipul.
Published:	Ann Arbor : ProQuest Dissertations & Theses, : 2021,
Description:	248 p.
Notes:	Source: Dissertations Abstracts International, Volume: 83-03, Section: B.
Contained By:	Dissertations Abstracts International83-03B.
Subject:	Electrical engineering. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28540020
ISBN:	9798535562889

Towards Ubiquitous Serverless Computing: Fast Large-Scale Machine Learning and Optimal Pricing for the Cloud.
Gupta, Vipul.

Towards Ubiquitous Serverless Computing: Fast Large-Scale Machine Learning and Optimal Pricing for the Cloud. - Ann Arbor : ProQuest Dissertations & Theses, 2021 - 248 p.

Source: Dissertations Abstracts International, Volume: 83-03, Section: B.

Thesis (Ph.D.)--University of California, Berkeley, 2021.

This item must not be sold to any third party vendors.

Serverless computing platforms represent the fastest-growing segment of cloud services and are predicted to dominate the future of cloud computing. However, the real-world applications of serverless systems are somewhat constrained due to several inherent bottlenecks such as their stateless nature, frequent occurrence of stragglers, naive resource allocation and pricing of computing resources, etc. The broader aim of this dissertation is to propose techniques to mitigate such bottlenecks and make the use of serverless computing ubiquitous. In particular, we focus on four applications that relate to large-scale serverless computing and describe them as follows.Total time for end-to-end distributed computation in such systems suffers due to a subset of slower workers, also referred to as stragglers. First, we propose straggler mitigation schemes for large-scale numerical linear algebra on serverless systems. Serverless systems allow users to massively scale the number of workers, but the total computation time is further exacerbated by high-communication latencies and the stateless nature of Function-as-a-Service (FaaS) platforms. Second, we further propose algorithms for large-scale convex optimization that are amenable to serverless systems. Recently, serverless computing --- due to its elasticity, scale, and ease of management --- has garnered significant traction from the industry and academia as a platform to train deep neural networks. Third, we further propose algorithms for massive scale non-convex optimization for training deep neural networks that take advantage of the scale of the serverless platform while mitigating communication costs. Finally, any ubiquitous platform is not viable until it serves the needs of the masses. In game-theoretic terms, a commercial platform should provide the required quality of services to customers while maximizing their utility (or satisfaction). Fourth, we propose principled yet practical schemes for allocating and pricing resources in serverless platforms.

ISBN: 9798535562889Subjects--Topical Terms:

649834
Electrical engineering.
Subjects--Index Terms:

Cloud computing

Towards Ubiquitous Serverless Computing: Fast Large-Scale Machine Learning and Optimal Pricing for the Cloud.
LDR:03321nmm a2200397 4500 001 2348600
005 20220912135615.5
008 241004s2021 ||||||||||||||||| ||eng d
020 $a 9798535562889
035 $a (MiAaPQ)AAI28540020
035 $a AAI28540020
040 $a MiAaPQ $c MiAaPQ
100 1 $a Gupta, Vipul. $3 907919
245 1 0 $a Towards Ubiquitous Serverless Computing: Fast Large-Scale Machine Learning and Optimal Pricing for the Cloud.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2021
300 $a 248 p.
500 $a Source: Dissertations Abstracts International, Volume: 83-03, Section: B.
500 $a Advisor: Ramchandran, Kannan;Courtade, Thomas.
502 $a Thesis (Ph.D.)--University of California, Berkeley, 2021.
506 $a This item must not be sold to any third party vendors.
520 $a Serverless computing platforms represent the fastest-growing segment of cloud services and are predicted to dominate the future of cloud computing. However, the real-world applications of serverless systems are somewhat constrained due to several inherent bottlenecks such as their stateless nature, frequent occurrence of stragglers, naive resource allocation and pricing of computing resources, etc. The broader aim of this dissertation is to propose techniques to mitigate such bottlenecks and make the use of serverless computing ubiquitous. In particular, we focus on four applications that relate to large-scale serverless computing and describe them as follows.Total time for end-to-end distributed computation in such systems suffers due to a subset of slower workers, also referred to as stragglers. First, we propose straggler mitigation schemes for large-scale numerical linear algebra on serverless systems. Serverless systems allow users to massively scale the number of workers, but the total computation time is further exacerbated by high-communication latencies and the stateless nature of Function-as-a-Service (FaaS) platforms. Second, we further propose algorithms for large-scale convex optimization that are amenable to serverless systems. Recently, serverless computing --- due to its elasticity, scale, and ease of management --- has garnered significant traction from the industry and academia as a platform to train deep neural networks. Third, we further propose algorithms for massive scale non-convex optimization for training deep neural networks that take advantage of the scale of the serverless platform while mitigating communication costs. Finally, any ubiquitous platform is not viable until it serves the needs of the masses. In game-theoretic terms, a commercial platform should provide the required quality of services to customers while maximizing their utility (or satisfaction). Fourth, we propose principled yet practical schemes for allocating and pricing resources in serverless platforms.
590 $a School code: 0028.
650 4 $a Electrical engineering. $3 649834
650 4 $a Computer science. $3 523869
650 4 $a Statistics. $3 517247
650 4 $a Sparsity. $3 3680690
650 4 $a Schedules. $3 3564128
650 4 $a Accuracy. $3 3559958
650 4 $a Datasets. $3 3541416
650 4 $a Communication. $3 524709
650 4 $a Experiments. $3 525909
650 4 $a Optimization. $3 891104
650 4 $a Feature selection. $3 3560270
650 4 $a Convex analysis. $3 3681761
650 4 $a Algorithms. $3 536374
653 $a Cloud computing
653 $a Information theory
653 $a Machine learning
653 $a Optimization
653 $a Resource allocation
653 $a Serverless computing
690 $a 0544
690 $a 0984
690 $a 0463
690 $a 0459
710 2 $a University of California, Berkeley. $b Electrical Engineering & Computer Sciences. $3 1671057
773 0 $t Dissertations Abstracts International $g 83-03B.
790 $a 0028
791 $a Ph.D.
792 $a 2021
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28540020