@inproceedings{Cla2011,
Author = {Clark, Brian and Stierand, Ingo and Thaden, Eike},
Title = {Cost-Minimal Pre-Allocation of Software Tasks Under Real-Time Constraints},

Year = {2011},
Pages = {77-83},
Month = {11},
Publisher = {The Association for Computing Machinery (ACM)},
Address = {2 Penn Plaza, Suite 701, New York New York 10121-0701},
Isbn = {978-1-4503-1087-1},
Booktitle = {Proceedings of the 2011 Research in Applied Computation Symposium (RACS 2011)},
type = {inproceedings},
note = {In this paper we motivate, mathematically formulate, and evaluate a novel approach for finding good pre-allocations for software tasks together with their communication messages onto a hardware system. The hardware system is composed of subsystems connect},
Abstract = {In this paper we motivate, mathematically formulate, and evaluate a novel approach for finding good pre-allocations for software tasks together with their communication messages onto a hardware system. The hardware system is composed of subsystems connected via a global communication bus. Each subsystem contains one or more processors whose type can be chosen from a set of processor types with different properties, such as monetary cost, available memory, etc. The overall optimization objective is to minimize the sum of all processor costs. This is done using a Satisfiability Modulo Theories solver with an extension for performing binary search on input variables.}
}
@COMMENT{Bibtex file generated on }