{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T09:56:52Z","timestamp":1768816612366,"version":"3.49.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1109\/pdp2018.2018.00030","type":"proceedings-article","created":{"date-parts":[[2018,6,7]],"date-time":"2018-06-07T19:44:22Z","timestamp":1528400662000},"page":"162-169","source":"Crossref","is-referenced-by-count":4,"title":["Scheduler Accelerator for TDMA Data Centers"],"prefix":"10.1109","author":[{"given":"Ioannis","family":"Patronas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikolaos","family":"Gkatzios","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vasileios","family":"Kitsakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dionysios","family":"Reisis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Konstantinos","family":"Christodoulopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emmanouel","family":"Varvarigos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Randomized scheduling algorithm for queueing networks","volume":"abs 908 3670","author":"shah","year":"2009","journal-title":"CoRR"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.134"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1364\/NETWORKS.2016.NeM3B.4"},{"key":"ref13","year":"0"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICTON.2016.7550704"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2038916.2038946"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2790035"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486007"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851223"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1364\/JOCN.5.000945"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/EuCNC.2016.7561045"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592576"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1402946.1402967"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1109\/SWAT.1971.1","article-title":"A n5\/2 algorithm for maximum matchings in bipartite","author":"hopcroft","year":"1971","journal-title":"12th Annual Symposium on Switching and Automata Theory (swat 1971) SWAT"}],"event":{"name":"2018 26th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP)","location":"Cambridge","start":{"date-parts":[[2018,3,21]]},"end":{"date-parts":[[2018,3,23]]}},"container-title":["2018 26th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8369619\/8374423\/08374453.pdf?arnumber=8374453","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T00:20:12Z","timestamp":1643156412000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8374453\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/pdp2018.2018.00030","relation":{},"subject":[],"published":{"date-parts":[[2018,3]]}}}