Search
Now showing items 11-12 of 12
Study of interconnection networks /
(1985)
A multi-stage N x N interconnection network is said to be universal if it realizes the set of all permutations on N objects. A new bound on the number of stages required for the universality of shuffle-exchange network as ...
Scheduling periodic-time-critical tasks on multiprocessor computing systems /
(1985)
The problem of allocating a set of periodic-time-critical tasks to processors in a multiprocessor system is considered. A periodic-time-critical task consists of a certain number of requests, arising periodically, each of ...