東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Parallel Real-Time Scheduling for La...

Li, Jing.

FindBook

Google Book

Amazon

博客來

Parallel Real-Time Scheduling for Latency-Critical Applications.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Parallel Real-Time Scheduling for Latency-Critical Applications./
作者:	Li, Jing.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2017,
面頁冊數:	355 p.
附註:	Source: Dissertation Abstracts International, Volume: 79-01(E), Section: B.
Contained By:	Dissertation Abstracts International79-01B(E).
標題:	Computer science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10615430
ISBN:	9780355206319

Parallel Real-Time Scheduling for Latency-Critical Applications.
Li, Jing.

Parallel Real-Time Scheduling for Latency-Critical Applications. - Ann Arbor : ProQuest Dissertations & Theses, 2017 - 355 p.

Source: Dissertation Abstracts International, Volume: 79-01(E), Section: B.

Thesis (Ph.D.)--Washington University in St. Louis, 2017.

In order to provide safety guarantees or quality of service guarantees, many of today's systems consist of latency-critical applications, e.g. applications with timing constraints. The problem of scheduling multiple latency-critical jobs on a multiprocessor or multicore machine has been extensively studied for sequential (non-parallizable) jobs and different system models and different objectives have been considered. However, the computational requirement of a single job is still limited by the capacity of a single core. To provide increasingly complex functionalities of applications and to complete their higher computational demands within the same or even more stringent timing constraints, we must exploit the internal parallelism of jobs, where individual jobs are parallel programs and can potentially utilize more than one core in parallel. However, there is little work considering scheduling multiple parallel jobs that are latency-critical.

ISBN: 9780355206319Subjects--Topical Terms:

523869
Computer science.

Parallel Real-Time Scheduling for Latency-Critical Applications.
LDR:04024nmm a2200313 4500 001 2125988
005 20171113103036.5
008 180830s2017 ||||||||||||||||| ||eng d
020 $a 9780355206319
035 $a (MiAaPQ)AAI10615430
035 $a AAI10615430
040 $a MiAaPQ $c MiAaPQ
100 1 $a Li, Jing. $3 1256720
245 1 0 $a Parallel Real-Time Scheduling for Latency-Critical Applications.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2017
300 $a 355 p.
500 $a Source: Dissertation Abstracts International, Volume: 79-01(E), Section: B.
500 $a Advisers: Chenyang Lu; Kunal Agrawal.
502 $a Thesis (Ph.D.)--Washington University in St. Louis, 2017.
520 $a In order to provide safety guarantees or quality of service guarantees, many of today's systems consist of latency-critical applications, e.g. applications with timing constraints. The problem of scheduling multiple latency-critical jobs on a multiprocessor or multicore machine has been extensively studied for sequential (non-parallizable) jobs and different system models and different objectives have been considered. However, the computational requirement of a single job is still limited by the capacity of a single core. To provide increasingly complex functionalities of applications and to complete their higher computational demands within the same or even more stringent timing constraints, we must exploit the internal parallelism of jobs, where individual jobs are parallel programs and can potentially utilize more than one core in parallel. However, there is little work considering scheduling multiple parallel jobs that are latency-critical.
520 $a This dissertation focuses on developing new scheduling strategies, analysis tools, and practical platform design techniques to enable efficient and scalable parallel real-time scheduling for latency-critical applications on multicore systems. In particular, the research is focused on two types of systems: (1) static real-time systems for tasks with deadlines where the temporal properties of the tasks that need to execute is known a priori and the goal is to guarantee the temporal correctness of the tasks prior to their executions; and (2) online systems for latency-critical jobs where multiple jobs arrive over time and the goal to optimize for a performance objective of jobs during the execution.
520 $a For static real-time systems for parallel tasks, several scheduling strategies, including global earliest deadline first, global rate monotonic and a novel federated scheduling, are proposed, analyzed and implemented. These scheduling strategies have the best known theoretical performance for parallel real-time tasks under any global strategy, any fixed priority scheduling and any scheduling strategy, respectively. In addition, federated scheduling is generalized to systems with multiple criticality levels and systems with stochastic tasks. Both numerical and empirical experiments show that federated scheduling and its variations have good schedulability performance and are efficient in practice.
520 $a For online systems with multiple latency-critical jobs, different online scheduling strategies are proposed and analyzed for different objectives, including maximizing the number of jobs meeting a target latency, maximizing the profit of jobs, minimizing the maximum latency and minimizing the average latency. For example, a simple First-In-First-Out scheduler is proven to be scalable for minimizing the maximum latency. Based on this theoretical intuition, a more practical work-stealing scheduler is developed, analyzed and implemented. Empirical evaluations indicate that, on both real world and synthetic workloads, this work-stealing implementation performs almost as well as an optimal scheduler.
590 $a School code: 0252.
650 4 $a Computer science. $3 523869
690 $a 0984
710 2 $a Washington University in St. Louis. $b Computer Science. $3 1682291
773 0 $t Dissertation Abstracts International $g 79-01B(E).
790 $a 0252
791 $a Ph.D.
792 $a 2017
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10615430