Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Publication
- Publication Type
Articles 1 - 4 of 4
Full-Text Articles in Entire DC Network
Reflections From The Seventh American Forest Congress: Some Thoughts For National Forest Management, William R. Bentley
Reflections From The Seventh American Forest Congress: Some Thoughts For National Forest Management, William R. Bentley
The National Forest Management Act in a Changing Society, 1976-1996: How Well Has It Worked in the Past 20 Years?: Will It Work in the 21st Century? (September 16-18)
21 pages.
Contains endnotes and references.
Design,Analysis And Routing In Static Interconnection Networks., Rajib Kumar Das Dr.
Design,Analysis And Routing In Static Interconnection Networks., Rajib Kumar Das Dr.
Doctoral Theses
Many real-life applications such as image processing, weather forecasting, digital signal processing, etc., require large amount of computations. By distributing the task among several processors, one can appreciably reduce the computation time. To solve complex problems, several computer architectures using multiple processors have been introduced. Recent developments in IC technology have made it economically feasible to construct multiple processor systems consisting of hundreds or thousands of processors.There are two types of multiprocessor systems (PS87). One is tightly coupled, where the processors share a common clock and/or memory. The other is loosely coupled, where each processor runs independently with a local …
Communication Games, Kimberly I. Noonan
Communication Games, Kimberly I. Noonan
Honors Theses
A communication game combines traditional n-person game theory with graph theory. The result is a model of a bargaining situation where communication is restricted. The game's multilinear extension (MLE), a polynomial that summarizes the solutions of the game, is well known for the case where the graph is a tree or simple cycle. This paper simplifies the computation of MLE of the communication game in the case when the graph is a series of simple cycles. The results are then applied to studying the power of each Canadian province in passing an amendment to the constitution, taking geographic location into …
Benchmarking The Computation And Communication Performance Of The Cm-5, Kivanc Dincer, Zeki Bozkus, Sanjay Ranka, Geoffrey C. Fox
Benchmarking The Computation And Communication Performance Of The Cm-5, Kivanc Dincer, Zeki Bozkus, Sanjay Ranka, Geoffrey C. Fox
Northeast Parallel Architecture Center
Thinking Machines' CM-5 machine is a distributed-memory, message-passing computer. In this paper we devise a performance benchmark for the base and vector units and the data communication networks of the CM-5 machine. We model the communication characteristics such as communication latency and bandwidths of point-to-point and global communication primitives. We show, on a simple Gaussian elimination code, that an accurate static performance estimation of parallel algorithms is possible by using those basic machine properties connected with computation, vectorization, communication, and synchronization. Furthermore, we describe the embedding of meshes or hypercubes on the CM-5 fat-tree topology and illustrate the performance results …