Technical Reports (Computing Science)
Technical Reports Collection
Items in this Collection
- 11Marsland, Tony
- 3Eskicioglu, M. Rasit
- 2Breitkreutz, T.
- 2Gao, Yaoqing
- 2Sutphen, Steven
- 1Bjornsson, Y.
- 3Distributed Shared Memory
- 3Distributed computing
- 2Message passing
- 2Parallel algorithms
Technical report TR98-08. Distributed Shared Memory (DSM) combines the scalability of loosely coupled multicomputer systems with the ease of usability of tightly coupled multiprocessors. DSM has received much attention in the past decade and many consistency models, protocols, and systems were...
Technical report TR96-22. There are two common programming models for intercommunication in parallel and distributed applications: shared memory and message passing. Shared memory has been the standard model for tightly-coupled systems (multiprocessors), where the processors have uniform access...
Technical report TR98-07. The thinking-process used by computers for chess and other two-person games differs significantly from the one used by humans. While humans consider at most a few alternatives when deciding what to play, computers exhaustively search all the possible moves. In the half...
Technical report TR93-02. With the continuing price-performance improvement of small computers there is growing interest in looking again at some of the heuristic techniques developed for problem-solving and planning programs, to see if they can be enhanced or replaced by more algorithmic...
Technical report TR95-05. The extreme efficiency of sequential search, and the natural tendency of tree pruning systems to produce wide variations in workload, partly explains why it is proving difficult to achieve more than 30-50% efficiency for massively parallel implementations of the...
Technical report TR93-03. There are several ways to search decision trees (one and two-person game trees) in parallel, from simple splitting at the root and Principal Variation Splitting, to Baudet's use of aspiration windows. These static schemes are simple and effective, but dynamic methods...
Technical report TR88-22. The report describes an environment for performing experiments in distributed processing. It replaces an earlier (1985) report, reflecting changes in the system and terminology. Our system offers researchers an easy way to design, implement, and test parallel...
Technical report TR89-11. This paper explains how to write Network Multiprocessor Package (NMP) applications. The technical report NMP--A Network Multi-processor [TR88-22] contains an overview of NMP, implementation details, more advanced usage information, and instructions for installing the...
Technical report TR95-23. Multiple threads can be used not only as a mechanism for tolerating unpredictable communication latency but also for facilitating dynamic scheduling and load balancing. Multithreaded systems are well suited to highly irregular and dynamic applications, such as tree...
Technical report TR98-10. Distributed shared memory (DSM) is a useful abstraction both for deploying networks of workstations as a parallel multicomputer and for increasing the usability of non-uniform memory access multicomputers. It provides an alternative programming model for distributed...