A network of personal computers may contain a large amount of distributed computing resources. For a number of reasons it is desirable to share these resources, but sharing is complicated by issues of security and autonomy. A process known as the Butler addresses these problems and provides support for resource sharing. The Butler relies upon a capability-based accounting system called the Banker to monitor the use of local resources.

A parallel algorithm for the solution of the eigen-value problem by the Jacobi method is described. At each step of the algorithm, n/2 off-diagonal elements of the n xn matrix are annihilated simultaneously. Furthermore, because of the regular pattern of interprocessor communication, this algorithm is suitable for efficient implementation on a simple loop multiple processor system.

Abstract We describe a technique (the adaptive creation of free lists) for dynamic storage allocation that is particularly suited to situations in which the distribution of sizes of blocks requested has one or more sharp peaks. We describe a particular dynamic storage allocation system and the environment in which it runs, and give the results of some experiments to determine the usefulness of the technique in this system. Our experiments also tested the efficacy of a technique suggested by Knuth for improving the performance of similar systems.

Theoretical and experimental results have indicated that automatic decompositions can discover modest amounts of parallelism. These investigations have tended to ignore the practical problems of language run-time organization, such as synchronization, communication, memory organization, resource management, and input/output. This paper describes a language implementation effort which combines the investigation of implicit and explicit parallel decomposition facilities with the practical considerations of system organization on a multiprocessor computer, Cm*.

Abstract Algorithms are presented which recreate infix form from reverse Polish form of algebraic expressions. The use of these algorithms in incremental compilers is discussed.