@inbook {19277,
	title = {Heterogeneous Design in Functional DIF},
	booktitle = {Transactions on High-Performance Embedded Architectures and Compilers IV},
	series = {Lecture Notes in Computer Science},
	year = {2011},
	month = {2011},
	pages = {391 - 408},
	publisher = {Springer Berlin Heidelberg},
	organization = {Springer Berlin Heidelberg},
	abstract = {Dataflow formalisms have provided designers of digital signal processing (DSP) systems with analysis and optimizations for many years. As system complexity increases, designers are relying on more types of dataflow models to describe applications while retaining these implementation benefits. The semantic range of DSP-oriented dataflow models has expanded to cover heterogeneous models and dynamic applications, but efficient design, simulation, and scheduling of such applications has not. To facilitate implementing heterogeneous applications, we utilize a new dataflow model of computation and show how actors designed in other dataflow models are directly supported by this framework, allowing system designers to immediately compose and simulate actors from different models. Using examples, we show how this approach can be applied to quickly describe and functionally simulate a heterogeneous dataflow-based application such that a designer may analyze and tune trade-offs among different models and schedules for simulation time, memory consumption, and schedule size.},
	keywords = {Arithmetic and Logic Structures, Computer Communication Networks, Dataflow, heterogeneous, Input/Output and Data Communications, Logic Design, Processor Architectures, Programming Languages, Compilers, Interpreters, Signal processing},
	isbn = {978-3-642-24567-1, 978-3-642-24568-8},
	url = {http://link.springer.com/chapter/10.1007/978-3-642-24568-8_20},
	author = {Plishker,William and Sane, Nimish and Kiemb, Mary and Bhattacharyya, Shuvra S.},
	editor = {Stenstr{\"o}m, Per}
}
@inbook {19586,
	title = {Flow Analysis, Linearity, and PTIME},
	booktitle = {Static Analysis},
	series = {Lecture Notes in Computer Science},
	year = {2008},
	month = {2008/01/01/},
	pages = {255 - 269},
	publisher = {Springer Berlin Heidelberg},
	organization = {Springer Berlin Heidelberg},
	abstract = {Flow analysis is a ubiquitous and much-studied component of compiler technology{\textemdash}and its variations abound. Amongst the most well known is Shivers{\textquoteright} 0CFA; however, the best known algorithm for 0CFA requires time cubic in the size of the analyzed program and is unlikely to be improved. Consequently, several analyses have been designed to approximate 0CFA by trading precision for faster computation. Henglein{\textquoteright}s simple closure analysis, for example, forfeits the notion of directionality in flows and enjoys an {\textquotedblleft}almost linear{\textquotedblright} time algorithm. But in making trade-offs between precision and complexity, what has been given up and what has been gained? Where do these analyses differ and where do they coincide? We identify a core language{\textemdash}the linear λ-calculus{\textemdash}where 0CFA, simple closure analysis, and many other known approximations or restrictions to 0CFA are rendered identical. Moreover, for this core language, analysis corresponds with (instrumented) evaluation. Because analysis faithfully captures evaluation, and because the linear λ-calculus is complete for ptime, we derive ptime-completeness results for all of these analyses.},
	keywords = {Logics and Meanings of Programs, Mathematical Logic and Formal Languages, Programming Languages, Compilers, Interpreters, Programming Techniques, software engineering},
	isbn = {978-3-540-69163-1, 978-3-540-69166-2},
	url = {http://link.springer.com/chapter/10.1007/978-3-540-69166-2_17},
	author = {David Van Horn and Mairson, Harry G.},
	editor = {Alpuente, Mar{\'\i}a and Vidal, Germ{\'a}n}
}
@inbook {19494,
	title = {Fault-Tolerant Middleware and the Magical 1\%},
	booktitle = {Middleware 2005},
	series = {Lecture Notes in Computer Science},
	year = {2005},
	month = {2005/01/01/},
	pages = {431 - 441},
	publisher = {Springer Berlin Heidelberg},
	organization = {Springer Berlin Heidelberg},
	abstract = {Through an extensive experimental analysis of over 900 possible configurations of a fault-tolerant middleware system, we present empirical evidence that the unpredictability inherent in such systems arises from merely 1\% of the remote invocations. The occurrence of very high latencies cannot be regulated through parameters such as the number of clients, the replication style and degree or the request rates. However, by selectively filtering out a {\textquotedblleft}magical 1\%{\textquotedblright} of the raw observations of various metrics, we show that performance, in terms of measured end-to-end latency and throughput, can be bounded, easy to understand and control. This simple statistical technique enables us to guarantee, with some level of confidence, bounds for percentile-based quality of service (QoS) metrics, which dramatically increase our ability to tune and control a middleware system in a predictable manner.},
	keywords = {Computer Communication Networks, Information Systems Applications (incl.Internet), Operating systems, Programming Languages, Compilers, Interpreters, Programming Techniques, software engineering},
	isbn = {978-3-540-30323-7, 978-3-540-32269-6},
	url = {http://link.springer.com/chapter/10.1007/11587552_24},
	author = {Tudor Dumitras and Narasimhan, Priya},
	editor = {Alonso, Gustavo}
}
