Optimal Scheduling for Exposed Datapath Architectures with Buffered Processing Units by ASP

DOI10.1017/S1471068418000170zbMath1451.68029arXiv1804.10998OpenAlexW2963373164MaRDI QIDQ4559805

Marc Dahlem, Klaus Schneider, Anoop Bhagyanath

Publication date: 4 December 2018

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.10998

zbMATH Keywords

code generationoptimal schedulinganswer set programmingexposed datapath architectures

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Mathematical problems of computer architecture (68M07) Logic programming (68N17)

Uses Software

• clasp
• TOAST

Cites Work

• Logic programming and nonmonotonic reasoning. 12th international conference, LPNMR 2013, Corunna, Spain, September 15--19, 2013. Proceedings
• Logic programming and nonmonotonic reasoning. 11th international conference, LPNMR 2011, Vancouver, Canada, May 16--19, 2011. Proceedings
• Logic programming and nonmonotonic reasoning. 10th international conference, LPNMR 2009, Potsdam, Germany, September 14--18, 2009. Proceedings
• Euro-Par 2006 parallel processing. 12th international Euro-Par conference, Dresden, Germany, August 28--September 1, 2006. Proceedings
• Logic programming and nonmonotonic reasoning. 14th international conference, LPNMR 2017, Espoo, Finland, July 3--6, 2017. Proceedings
• Logic programming and nonmonotonic reasoning. 9th international conference, LPNMR 2007, Tempe, AZ, USA, May 15--17, 2007. Proceedings
• Synthesizing Concurrent Programs Using Answer Set Programming
• TOAST: Applying Answer Set Programming to Superoptimisation
• The Generation of Optimal Code for Arithmetic Expressions

This page was built for publication: Optimal Scheduling for Exposed Datapath Architectures with Buffered Processing Units by ASP