{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:58Z","timestamp":1759639078089,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030599003"},{"type":"electronic","value":"9783030599010"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-59901-0_8","type":"book-chapter","created":{"date-parts":[[2020,9,22]],"date-time":"2020-09-22T08:02:41Z","timestamp":1600761761000},"page":"83-95","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimizing Energy on Homogeneous Processors with Shared Memory"],"prefix":"10.1007","author":[{"given":"Vincent","family":"Chau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chi Kit Ken","family":"Fong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengxin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elaine Yinling","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,23]]},"reference":[{"issue":"5","key":"8_CR1","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1145\/1735223.1735245","volume":"53","author":"S Albers","year":"2010","unstructured":"Albers, S.: Energy-efficient algorithms. Commun. ACM 53(5), 86\u201396 (2010)","journal-title":"Commun. ACM"},{"key":"8_CR2","unstructured":"Albers, S.: Algorithms for dynamic speed scaling. In: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011. LIPIcs, vol. 9, pp. 1\u201311 (2011)"},{"issue":"2","key":"8_CR3","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/s00453-012-9678-7","volume":"68","author":"S Albers","year":"2014","unstructured":"Albers, S., M\u00fcller, F., Schmelzer, S.: Speed scaling on parallel processors. Algorithmica 68(2), 404\u2013425 (2014). https:\/\/doi.org\/10.1007\/s00453-012-9678-7","journal-title":"Algorithmica"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2014.05.023","volume":"175","author":"E Angel","year":"2014","unstructured":"Angel, E., Bampis, E., Chau, V.: Low complexity scheduling algorithms minimizing the energy for tasks with agreeable deadlines. Discrete Appl. Math. 175, 1\u201310 (2014)","journal-title":"Discrete Appl. Math."},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Antoniadis, A., Huang, C.C., Ott, S.: A fully polynomial-time approximation scheme for speed scaling with sleep state. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2015)","DOI":"10.1137\/1.9781611973730.74"},{"issue":"4","key":"8_CR6","first-page":"184","volume":"2","author":"E Bampis","year":"2012","unstructured":"Bampis, E., D\u00fcrr, C., Kacem, F., Milis, I.: Speed scaling with power down scheduling for agreeable deadlines. Sustain.Comput. Inform. Syst. 2(4), 184\u2013189 (2012)","journal-title":"Sustain.Comput. Inform. Syst."},{"key":"8_CR7","unstructured":"Baptiste, P.: Scheduling unit tasks to minimize the number of idle periods: a polynomial time algorithm for offline dynamic power management. In: Proceedings of the 17th Annual ACM-SIAM SODA, 2006. pp. 364\u2013367. ACM Press (2006)"},{"issue":"3","key":"8_CR8","doi-asserted-by":"publisher","first-page":"26:1","DOI":"10.1145\/2229163.2229170","volume":"8","author":"P Baptiste","year":"2012","unstructured":"Baptiste, P., Chrobak, M., D\u00fcrr, C.: Polynomial-time algorithms for minimum energy scheduling. ACM Trans. Algorithms 8(3), 26:1\u201326:29 (2012)","journal-title":"ACM Trans. Algorithms"},{"key":"8_CR9","unstructured":"Chen, J.J., Hsu, H.R., Kuo, T.W.: Leakage-aware energy-efficient scheduling of real-time tasks in multiprocessor systems. In: Proceedings of IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS), pp. 408\u2013417 (2006)"},{"issue":"2","key":"8_CR10","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10951-012-0309-6","volume":"16","author":"ED Demaine","year":"2013","unstructured":"Demaine, E.D., Ghodsi, M., Hajiaghayi, M., Sayedi-Roshkhar, A.S., Zadimoghaddam, M.: Scheduling to minimize gaps and power consumption. J. Sched. 16(2), 151\u2013160 (2013). https:\/\/doi.org\/10.1007\/s10951-012-0309-6","journal-title":"J. Sched."},{"issue":"3","key":"8_CR11","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1007\/s10878-017-0229-7","volume":"35","author":"C Fu","year":"2018","unstructured":"Fu, C., Chau, V., Li, M., Xue, C.J.: Race to idle or not: balancing the memory sleep time with DVS for energy minimization. J. Comb. Optim. 35(3), 860\u2013894 (2018). https:\/\/doi.org\/10.1007\/s10878-017-0229-7","journal-title":"J. Comb. Optim."},{"issue":"4","key":"8_CR12","doi-asserted-by":"publisher","first-page":"41:1","DOI":"10.1145\/1290672.1290678","volume":"3","author":"S Irani","year":"2007","unstructured":"Irani, S., Shukla, S., Gupta, R.: Algorithms for power savings. ACM Trans. Algorithms 3(4), 41:1\u201341:23 (2007)","journal-title":"ACM Trans. Algorithms"},{"issue":"11","key":"8_CR13","doi-asserted-by":"publisher","first-page":"3983","DOI":"10.1073\/pnas.0510886103","volume":"103","author":"M Li","year":"2006","unstructured":"Li, M., Yao, A.C., Yao, F.F.: Discrete and continuous min-energy schedules for variable voltage processors. Proc. Natl. Acad. Sci. USA 103(11), 3983\u20133987 (2006)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-319-55911-7_28","volume-title":"Theory and Applications of Models of Computation","author":"M Li","year":"2017","unstructured":"Li, M., Yao, F.F., Yuan, H.: An $$O(n^2)$$ algorithm for computing optimal continuous voltage schedules. In: Gopal, T.V., J\u00e4ger, G., Steila, S. (eds.) TAMC 2017. LNCS, vol. 10185, pp. 389\u2013400. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-55911-7_28"},{"issue":"6","key":"8_CR15","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1007\/s10951-018-0565-1","volume":"21","author":"W Wu","year":"2018","unstructured":"Wu, W., Li, M., Wang, K., Huang, H., Chen, E.: Speed scaling problems with memory\/cache consideration. J. Sched. 21(6), 633\u2013646 (2018). https:\/\/doi.org\/10.1007\/s10951-018-0565-1","journal-title":"J. Sched."},{"key":"8_CR16","unstructured":"Yao, F., Demers, A., Shenker, S.: A scheduling model for reduced CPU energy. In: Proceedings of IEEE Annual Symposium on Foundations of Computer Science (FOCS), pp. 374\u2013382 (1995)"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59901-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T16:05:09Z","timestamp":1619280309000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-59901-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030599003","9783030599010"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59901-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"23 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Haikou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conference.cs.cityu.edu.hk\/faw2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"80% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}