Optimal randomized and deterministic algorithms have been given for k-k routing on two-dimensional nn meshes. The deterministic algorithm is based on "column-sort" and e...
This study1 explores the applicability of fully automatic parallelizing techniques for parallel computers. In this study, we capitalize on a variety of traditional compiling techn...
The multi-pattern scheduling algorithm is designed to schedule a graph onto a coarse-grained reconfigurable architecture, the result of which depends highly on the used patterns....
We describe the goals and architecture of a new framework that aims at facilitating the deployment of adaptation services running on intermediate edge servers. The main goal is to...
To support a vast set of user requirements, flexibility and extensibility are essential features of a metasystem architecture. We present an execution model, the Reflective Graph ...
Anh Nguyen-Tuong, Steve J. Chapin, Andrew S. Grims...