Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 5 of 5
Full-Text Articles in Physical Sciences and Mathematics
Prefetching In File Systems For Mimd Multiprocessors, Carla Schlatter Ellis, David Kotz
Prefetching In File Systems For Mimd Multiprocessors, Carla Schlatter Ellis, David Kotz
Dartmouth Scholarship
The problem of providing file I/O to parallel programs has been largely neglected in the development of multiprocessor systems. There are two essential elements of any file system design intended for a highly parallel environment: parallel I/O and effective caching schemes. This paper concentrates on the second aspect of file system design and specifically, on the question of whether prefetching blocks of the file into the block cache can effectively reduce overall execution time of a parallel computation, even under favorable assumptions. \par Experiments have been conducted with an interleaved file system testbed on the Butterfly Plus multiprocessor. Results of …
A Comparison Of Consistency Control Protocols, Michael Goldweber, Donald B. Johnson, Larry Raab
A Comparison Of Consistency Control Protocols, Michael Goldweber, Donald B. Johnson, Larry Raab
Computer Science Technical Reports
In this paper we analyze three protocols for maintaining the mutual consistency of replicated objects in a distributed computing environment and compare their performance with that of an oracle protocol whose performance is optimal. We examine these protocols, two dynamic protocols and the majority consensus protocol, via simulations using two measures of availability. The analysis shows that the dynamic protocols, under realistic assumptions, do not perform significantly better than the static voting scheme. Finally we demonstrate that none of these approaches perform as well as our oracle protocol which is shown to be an upper bound on availability.
On The Worst Case Of Three Algorithms For Computing The Jacobi Symbol, Jeffrey Shallit
On The Worst Case Of Three Algorithms For Computing The Jacobi Symbol, Jeffrey Shallit
Computer Science Technical Reports
We study the worst-case behavior of three iterative algorithms- Eisenstein's algorithm, Lebesgue's algorithm, and the "ordinary" Jacobi symbol algorithm - for computing the Jacobi symbol. Each algorithm is similar in format to the Euclidean algorithm for computing gcd (u,v).
Asymptotically Fast Algorithms For Spherical And Related Transforms, James R. Driscoll, Dennis M. Healy
Asymptotically Fast Algorithms For Spherical And Related Transforms, James R. Driscoll, Dennis M. Healy
Computer Science Technical Reports
This paper considers the problem of computing the harmonic expansion of functions defined on the sphere. We begin by proving convolution theorems that relate the convolution of two functions on the sphere to a "multiplication" in the sprectral domain, as well as the multiplication of two functions on the sphere to a "convolution" in the spectral domain. These convolution theorems are then used to develop a sampling theorem on the sphere.
Evaluation Of Concurrent Pools, David Kotz, Carla Ellis
Evaluation Of Concurrent Pools, David Kotz, Carla Ellis
Dartmouth Scholarship
The assignment of resources or tasks to processors in a distributed or parallel system needs to be done in a fashion that helps to balance the load and scales to large configurations. In an architectural model that distinguishes between local and remote data access, it is important to base these allocation functions on a mechanism that preserves locality and avoids high-latency remote references. This paper explores performance considerations affecting the design of such a mechanism, the Concurrent Pools data structure. We evaluate the effectiveness of three different implementations of concurrent pools under a variety of stressful workloads. Our experiments expose …