Repository logo
  • English
  • 中文
Log In
Have you forgotten your password?
  1. Home
  2. College of Electrical Engineering and Computer Science / 電機資訊學院
  3. Computer Science and Information Engineering / 資訊工程學系
  4. Task scheduling techniques for deep learning in heterogeneous environment
 
  • Details

Task scheduling techniques for deep learning in heterogeneous environment

Journal
Proceedings - 2019 7th International Symposium on Computing and Networking Workshops, CANDARW 2019
Pages
141-147
Date Issued
2019
Author(s)
PANGFENG LIU  
Wu, J.-J.
DOI
10.1109/CANDARW.2019.00033
URI
https://www.scopus.com/inward/record.url?eid=2-s2.0-85078837766&partnerID=40&md5=8861a56d8b099d7db0134bd1c93d0841
https://scholars.lib.ntu.edu.tw/handle/123456789/559140
Abstract
The training of deep learning requires heavy computation, and is the focus of deep learning system optimization. The training of deep learning has three characteristics. First, the training repeats a sequence of identical tasks. Second, the training is done in batches, i.e., the training performs the same computation on a batch of input data. Third, the training system usually has several different types of computation devices, e.g., CPU, GPU, and FPGA, so the environment is heterogeneous. An efficient deep learning system must consider the three characteristics mentioned above, and address three issues. First, since the system is heterogeneous, every task can run on every computation device. As a result, we need to assign every task to an appropriate device to reduce computation cost. Second, the computation devices are exclusive, therefore, we need to carefully schedule tasks from different batches so that no tasks that require the same device are assigned to the device at the same time. Finally, two tasks A and B have their own most appropriate devices. However, the task B may need the output of A as input, so if A and B are mapped to different devices, heavy communication overhead may incur. We develop two algorithms to address these issues. We first solve the task-device mapping problem by transforming it into a generalized shortest path problem. We then use a concatenation algorithm to schedule tasks from multiple batches in such a way that no device conflict will happen. We show that both algorithms are efficient and optimal, in terms of scheduling quality.
SDGs

[SDGs]SDG3

Type
conference paper

臺大位居世界頂尖大學之列,為永久珍藏及向國際展現本校豐碩的研究成果及學術能量,圖書館整合機構典藏(NTUR)與學術庫(AH)不同功能平台,成為臺大學術典藏NTU scholars。期能整合研究能量、促進交流合作、保存學術產出、推廣研究成果。

To permanently archive and promote researcher profiles and scholarly works, Library integrates the services of “NTU Repository” with “Academic Hub” to form NTU Scholars.

總館學科館員 (Main Library)
醫學圖書館學科館員 (Medical Library)
社會科學院辜振甫紀念圖書館學科館員 (Social Sciences Library)

開放取用是從使用者角度提升資訊取用性的社會運動,應用在學術研究上是透過將研究著作公開供使用者自由取閱,以促進學術傳播及因應期刊訂購費用逐年攀升。同時可加速研究發展、提升研究影響力,NTU Scholars即為本校的開放取用典藏(OA Archive)平台。(點選深入了解OA)

  • 請確認所上傳的全文是原創的內容,若該文件包含部分內容的版權非匯入者所有,或由第三方贊助與合作完成,請確認該版權所有者及第三方同意提供此授權。
    Please represent that the submission is your original work, and that you have the right to grant the rights to upload.
  • 若欲上傳已出版的全文電子檔,可使用Open policy finder網站查詢,以確認出版單位之版權政策。
    Please use Open policy finder to find a summary of permissions that are normally given as part of each publisher's copyright transfer agreement.
  • 網站簡介 (Quickstart Guide)
  • 使用手冊 (Instruction Manual)
  • 線上預約服務 (Booking Service)
  • 方案一:臺灣大學計算機中心帳號登入
    (With C&INC Email Account)
  • 方案二:ORCID帳號登入 (With ORCID)
  • 方案一:定期更新ORCID者,以ID匯入 (Search for identifier (ORCID))
  • 方案二:自行建檔 (Default mode Submission)
  • 方案三:學科館員協助匯入 (Email worklist to subject librarians)

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science