Abstract. We consider three paradigms of computation where the bene ts of a parallel solution are greater than usual. Paradigm 1 works on a time-varying input data set, whose size ...
In this paper, we propose a priority-based balanced routing scheme, called the priority STAR routing scheme, which leads to optimal throughput and average delay at the same time f...
Chi-Hsiang Yeh, Emmanouel A. Varvarigos, Abdelhami...
ontainer. In particular, an iterator abstracts away differences in specific container types, allowing you to view the collection simply as a sequence of items. A generic algorith...
We describe the rst parallel algorithm with optimal speedup for constructing minimum-width tree decompositions of graphs of bounded treewidth. On n-vertex input graphs, the algori...
Real-time embedded systems typically include concurrent tasks of different priorities with time-dependent operations accessing common resources. In this context, unsynchronized pa...
Cristina Cerschi Seceleanu, Paul Pettersson, Hans ...