{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,5,3]],"date-time":"2022-05-03T20:11:15Z","timestamp":1651608675428},"reference-count":17,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput. Sci. Eng."],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1109\/mcse.2018.110145709","type":"journal-article","created":{"date-parts":[[2018,1,11]],"date-time":"2018-01-11T19:35:09Z","timestamp":1515699309000},"page":"63-76","source":"Crossref","is-referenced-by-count":1,"title":["An Approximate Optimal Solution to GPU Workload Scheduling"],"prefix":"10.1109","volume":"20","author":[{"given":"Yanhua","family":"Wang","sequence":"first","affiliation":[{"name":"Northeastern University, Shenyang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianzhong","family":"Qiao","sequence":"additional","affiliation":[{"name":"Northeastern University, Shenyang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shukuan","family":"Lin","sequence":"additional","affiliation":[{"name":"Northeastern University, Shenyang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tinglei","family":"Zhao","sequence":"additional","affiliation":[{"name":"Northeastern University, Shenyang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"233","article-title":"PTask: Operating System Abstractions to Manage GPUs as Compute Devices","author":"rossbach","year":"0","journal-title":"Proc ACM Symp on Operating Systems Principles"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2013.12.038"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2014.06.009"},{"key":"ref13","first-page":"1097","article-title":"Improving GPU Performance Prediction with Data Transfer Modeling","author":"boyer","year":"0","journal-title":"IEEE 27th Int'l Symp Parallel & Distributed Processing Workshops and PhD Forum"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2016.01.011"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1016\/j.asoc.2015.10.043","article-title":"An Improved Monkey Algorithm for a 0-1 Knapsack Problem","volume":"38","author":"zhou","year":"2015","journal-title":"Applied Soft Computing"},{"key":"ref16","first-page":"1","article-title":"Improved Fully Polynomial time Approximation Scheme for the 0-1 Multiple-Choice Knapsack Problem","author":"bansal","year":"0","journal-title":"Proc 10th SIAM Conf Discrete Mathematics"},{"key":"ref17","first-page":"1259","article-title":"Performance Optimization for CPU-GPU Heterogeneous Parallel System","author":"wang","year":"0","journal-title":"Proc Int'l Conf Natural Computation Fuzzy Systems and Knowledge Discovery"},{"key":"ref4","first-page":"88","article-title":"A Static Task Scheduling Framework for Independent Tasks Accelerated Using a Shared Graphics Processing Unit","author":"li","year":"0","journal-title":"Proc IEEE 17th Int'l Conf Parallel and Distributed Systems"},{"key":"ref3","first-page":"17","article-title":"Timegraph: GPU Scheduling for Real-Time Multi-Tasking Environments","author":"kato","year":"0","journal-title":"Proc USENIX Ann Technical Conf"},{"key":"ref6","first-page":"57","article-title":"RGEM: A Responsive GPGPU Execution Model for Runtime Engines","author":"kato","year":"0","journal-title":"Proc IEEE Real-Time Systems Symp"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1145\/1809028.1806606","article-title":"A GPGPU Compiler for Memory Optimization and Parallelism Management","volume":"45","author":"yang","year":"2010","journal-title":"ACM SIGPLAN Notices"},{"key":"ref8","first-page":"733","article-title":"GPU Resource Sharing and Virtualization on High Performance Computing Ssystems","author":"li","year":"0","journal-title":"Proc Int'l Conf IEEE Parallel Processing (ICPP 11)"},{"key":"ref7","first-page":"10","article-title":"Fine Grained Resource Sharing for Concurrent GPGPU Kernels","author":"gregg","year":"0","journal-title":"Proc 4th USENIX Conference on Hot Topics in Parallelism"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2016.02.005"},{"key":"ref1","first-page":"401","article-title":"First-Class GPU Resource Management in the Operating System","author":"kato","year":"0","journal-title":"Proc USENIX Ann Technical Conf"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2016.03.011"}],"container-title":["Computing in Science & Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5992\/8452043\/08254314.pdf?arnumber=8254314","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,3]],"date-time":"2022-05-03T19:57:57Z","timestamp":1651607877000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8254314\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9]]},"references-count":17,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/mcse.2018.110145709","relation":{},"ISSN":["1521-9615","1558-366X"],"issn-type":[{"value":"1521-9615","type":"print"},{"value":"1558-366X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9]]}}}