Benchmarking has become one of the most important methods for quantitative performance
evaluation of processor and computer system designs. Benchmarking of modern …

A large class of applications need to execute the same workflow on different datasets of
identical size. Efficient execution of such applications necessitates intelligent distribution of …

In this paper we present an approach for quantitative analysis of application-specific
dataflow architectures. The approach allows the designer to rate design alternatives in a …

Metric temporal logic (MTL) is a prominent specification formalism for real-time systems. In
this paper, we show that the satisfiability problem for MTL over finite timed words is …

Distributed enterprise applications today are increasingly being built from services available
over the web. A unit of functionality in this framework is a web service, a software application …

Focusing on algorithms for distributed-memory parallel architectures, Parallel Algorithms
presents a rigorous yet accessible treatment of theoretical models of parallel computation …

Languages that support task and data parallelism are highly general and can exploit both
forms of parallelism in a single application. However, cleanly integrating the two forms of …

A heuristic algorithm that maps data processing tasks onto heterogeneous resources (ie
processors and links of various capacities) is presented. The algorithm tries to achieve a …

Mapping applications onto parallel platforms is a challenging problem, that becomes even
more difficult when platforms are heterogeneous—nowadays a standard assumption. A high …

Networked systems provide a cost-effective platform for parallel computing, but the
applications have to deal with the changing availability of computation and communication …