{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T12:01:19Z","timestamp":1762430479765,"version":"3.28.0"},"reference-count":25,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,7]]},"DOI":"10.1109\/memcod.2010.5558635","type":"proceedings-article","created":{"date-parts":[[2010,8,27]],"date-time":"2010-08-27T14:37:22Z","timestamp":1282919842000},"page":"189-198","source":"Crossref","is-referenced-by-count":9,"title":["Minimizing back pressure for latency insensitive system synthesis"],"prefix":"10.1109","author":[{"given":"Bin","family":"Xue","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandeep K.","family":"Shukla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. S.","family":"Ravi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/5.24143"},{"key":"ref11","first-page":"180","article-title":"N-synchronous kahn networks - a relaxed model of synchrony for real-time systems","author":"cohen","year":"2006","journal-title":"ACM International Conference on Principles of Programming Languages (POPL06)"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ACSD.2009.12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2008.02.004"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/0201010"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/43.728912"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230070103"},{"journal-title":"Algorithm Design","year":"2005","author":"kleinberg","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2008.4681613"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/HLDVT.2009.5340183"},{"key":"ref4","first-page":"576","article-title":"A new approach to latency insensitive design","author":"casu","year":"2004","journal-title":"Proceedings 41st Design Automation Conference 2004 DAC"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ASYNC.2002.1000291"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2005.05.036"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1155\/2007\/39161","article-title":"Formal methods for scheduling of latency-insensitive designs","volume":"2007","author":"boucaron","year":"2007","journal-title":"EURASIP J Embedded Syst"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1109\/TCAD.2005.854636","article-title":"Performance analysis of latency-insensitive systems","volume":"25","author":"lu","year":"2006","journal-title":"Computer-Aided Design of Integrated Circuits and Systems IEEE Transactions on"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.2008914"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1146909.1147077"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1145\/1278480.1278587","article-title":"synchronous elastic circuits with early evaluation and token counterflow","author":"cortadella","year":"2007","journal-title":"2007 44th ACM\/IEEE Design Automation Conference DAC"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/43.945302"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/MEMCOD.2007.371256"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.6028\/jres.071B.032"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/3-540-44988-4_27","article-title":"LoLA: A Low Level Analyser","volume":"1825","author":"schmidt","year":"2000","journal-title":"Lecture Notes in Computer Science 21st International Conference on Application and Theory of Petri Nets (ICATPN 2000"},{"key":"ref24","first-page":"29","article-title":"An algorithm to construct a minimum directed spanning tree in a directed network","author":"bock","year":"1971","journal-title":"Developments in Operations Research Gordon and Breach"},{"key":"ref23","first-page":"1396","article-title":"On the shortest arborescence of a directed graph","volume":"14","author":"chu","year":"1965","journal-title":"Science Sinica"},{"year":"0","key":"ref25"}],"event":{"name":"2010 8th IEEE\/ACM International Conference on Formal Methods and Models for Codesign (MEMOCODE 2010)","start":{"date-parts":[[2010,7,26]]},"location":"Grenoble, France","end":{"date-parts":[[2010,7,28]]}},"container-title":["Eighth ACM\/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE 2010)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5550962\/5558619\/05558635.pdf?arnumber=5558635","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T11:05:34Z","timestamp":1559473534000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5558635\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/memcod.2010.5558635","relation":{},"subject":[],"published":{"date-parts":[[2010,7]]}}}