This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
This paper develops some control structures suitable for composing fault-tolerant distrib uted applications using atomic actions (atomic transactions) as building blocks, and then...
The underlying model of distributed systems is that of loosely coupled components r running in parallel and communicating by message passing. Description, construction and evoluti...
Control intensive scalar programs pose a very different challenge to highly pipelined supercomputers than vectorizable numeric applications. Function call/return and branch instru...
We consider iterative algorithms of the form z := f(z), executed by a parallel or distributed computing system. We focus on asynchronous implementations whereby each processor ite...
We examine computing alternative solutions to a problem in parallel to improve response time. Problems with exploring multiple alternatives in parallel include (1) side-effects an...
Efficient hypercube algorithms are developed for the following image transformations: shrinking, expanding, translation, rotation, and scaling. A 2k −step shrinking and expandi...
We develop a serial algorithm for separable median filtering that requires only two comparisons per element when the window size is three. In addition, fast parallel CREW PRAM al...