Resource Constrained and Speculative Scheduling of an Algorithm Class with Run-Time Dependent Conditionals

	This Article
	Subscribers, please Login Purchase article: $19 PDF RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Frank Hannig Articles by J? Teich

15th IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP'04)

Galveston, Texas

September 27-September 29

ISBN: 0-7695-2226-2

	ASCII Text	x
	Frank Hannig, J? Teich, "Resource Constrained and Speculative Scheduling of an Algorithm Class with Run-Time Dependent Conditionals," Application-Specific Systems, Architectures and Processors, IEEE International Conference on, pp. 17-27, 15th IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP'04), 2004.

	BibTex	x
	@article{ 10.1109/ASAP.2004.10029, author = {Frank Hannig and J? Teich}, title = {Resource Constrained and Speculative Scheduling of an Algorithm Class with Run-Time Dependent Conditionals}, journal ={Application-Specific Systems, Architectures and Processors, IEEE International Conference on}, volume = {0}, year = {2004}, issn = {1063-6862}, pages = {17-27}, doi = {http://doi.ieeecomputersociety.org/10.1109/ASAP.2004.10029}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Application-Specific Systems, Architectures and Processors, IEEE International Conference on TI - Resource Constrained and Speculative Scheduling of an Algorithm Class with Run-Time Dependent Conditionals SN - 1063-6862 SP17 EP27 A1 - Frank Hannig, A1 - J? Teich, PY - 2004 KW - null VL - 0 JA - Application-Specific Systems, Architectures and Processors, IEEE International Conference on ER -

Frank Hannig, University of Erlangen-Nuremberg, Germany

J? Teich, University of Erlangen-Nuremberg, Germany

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ASAP.2004.10029

In this paper we present a significant extension of the quantified equation based algorithm class of piecewise regular algorithms. The main contributions of the following paper are: (1) the class of piecewise regular algorithms is extended by allowing run-time dependent conditionals, (2) a mixed integer linear program is given to derive optimal schedules of the novel class we call dynamic piece-wise regular algorithms, and (3) in order to achieve highest performance, we present a speculative scheduling approach. The results are applied to an illustrative example.

Citation:

Frank Hannig, J? Teich, "Resource Constrained and Speculative Scheduling of an Algorithm Class with Run-Time Dependent Conditionals," asap, pp.17-27, 15th IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP'04), 2004

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.