Results 1 - 10 of 30,166

Parallel Numerical Linear Algebra

by James W. Demmel, Michael T. Heath , Henk A. van der Vorst , 1993
"... We survey general techniques and open problems in numerical linear algebra on parallel architectures. We first discuss basic principles of parallel processing, describing the costs of basic operations on parallel machines, including general principles for constructing efficient algorithms. We illust ..."
Abstract - Cited by 773 (23 self) - Add to MetaCart
We survey general techniques and open problems in numerical linear algebra on parallel architectures. We first discuss basic principles of parallel processing, describing the costs of basic operations on parallel machines, including general principles for constructing efficient algorithms. We

PVM: A Framework for Parallel Distributed Computing

by V. S. Sunderam - Concurrency: Practice and Experience , 1990
"... The PVM system is a programming environment for the development and execution of large concurrent or parallel applications that consist of many interacting, but relatively independent, components. It is intended to operate on a collection of heterogeneous computing elements interconnected by one or ..."
Abstract - Cited by 788 (27 self) - Add to MetaCart
The PVM system is a programming environment for the development and execution of large concurrent or parallel applications that consist of many interacting, but relatively independent, components. It is intended to operate on a collection of heterogeneous computing elements interconnected by one

GloMoSim: A Library for Parallel Simulation of Large-scale Wireless Networks

by Xiang Zeng, Rajive Bagrodia, Mario Gerla - in Workshop on Parallel and Distributed Simulation , 1998
"... A number of library-based parallel and sequential network simulators have been designed. This paper describes a library, called GloMoSim (for Global Mobile system Simulator), for parallel simulation of wireless networks. GloMoSim has been designed to be extensible and composable: the communication p ..."
Abstract - Cited by 650 (30 self) - Add to MetaCart
protocol stack for wireless networks is divided into a set of layers, each with its own API. Models of protocols at one layer interact with those at a lower (or higher) layer only via these APIs. The modular implementation enables consistent comparison of multiple protocols at a given layer. The parallel

Macroscopic strings as heavy quarks in large N gauge theory and Anti-de Sitter supergravity

by Soo-jong Rey, Jung-tay Yee - PHYS. J. C22
"... Maldacena has put forward large N correspondence between superconformal field theories on the brane and anti-de Sitter supergravity in spacetime. We study some aspects of the correspondence between N = 4 superconformal gauge theory on D3-brane and maximal supergravity on adS5 × S5 by introducing mac ..."
Abstract - Cited by 508 (1 self) - Add to MetaCart
and recoil of heavy quark thereof, and of heavy baryon via of N-prong string junction. Throughout comparisons of the correspondence, we emphasize crucial role played by ‘geometric duality ’ between coordinates perpendicular to D3-brane and parallel ones, hinting a possible explanation of emergence

A simple parallel algorithm for the maximal independent set problem

by Michael Luby - SIAM Journal on Computing , 1986
"... Simple parallel algorithms for the maximal independent set (MIS) problem are presented. The first algorithm is a Monte Carlo algorithm with a very local property. The local property of this algorithm may make it a useful protocol design tool in distributed computing environments and artificial intel ..."
Abstract - Cited by 450 (9 self) - Add to MetaCart
Simple parallel algorithms for the maximal independent set (MIS) problem are presented. The first algorithm is a Monte Carlo algorithm with a very local property. The local property of this algorithm may make it a useful protocol design tool in distributed computing environments and artificial

A learning algorithm for Boltzmann machines

by H. Ackley, E. Hinton, J. Sejnowski - Cognitive Science , 1985
"... The computotionol power of massively parallel networks of simple processing elements resides in the communication bandwidth provided by the hardware connections between elements. These connections con allow a significant fraction of the knowledge of the system to be applied to an instance of a probl ..."
Abstract - Cited by 584 (13 self) - Add to MetaCart
problem in o very short time. One kind of computation for which massively porollel networks appear to be well suited is large constraint satisfaction searches, but to use the connections efficiently two conditions must be met: First, a search technique that is suitable for parallel networks must be found

MapReduce: Simplified data processing on large clusters.

by Jeffrey Dean , Sanjay Ghemawat - In Proceedings of the Sixth Symposium on Operating System Design and Implementation (OSDI-04), , 2004
"... Abstract MapReduce is a programming model and an associated implementation for processing and generating large data sets. Programs written in this functional style are automatically parallelized and executed on a large cluster of commodity machines. The run-time system takes care of the details of ..."
Abstract - Cited by 3439 (3 self) - Add to MetaCart
Abstract MapReduce is a programming model and an associated implementation for processing and generating large data sets. Programs written in this functional style are automatically parallelized and executed on a large cluster of commodity machines. The run-time system takes care of the details

Nonmonotonic Reasoning, Preferential Models and Cumulative Logics

by Sarit Kraus, Daniel Lehmann, Menachem Magidor , 1990
"... Many systems that exhibit nonmonotonic behavior have been described and studied already in the literature. The general notion of nonmonotonic reasoning, though, has almost always been described only negatively, by the property it does not enjoy, i.e. monotonicity. We study here general patterns of ..."
Abstract - Cited by 626 (14 self) - Add to MetaCart
of view are developed in parallel. The former point of view was pioneered by D. Gabbay in [10], while the latter has been advocated by Y. Shoham in [38]. Five such families are defined and characterized by representation theorems, relating the two points of view. One of the families of interest

Combining Branch Predictors

by Scott Mcfarling , 1993
"... One of the key factors determining computer performance is the degree to which the implementation can take advantage of instruction-level paral-lelism. Perhaps the most critical limit to this parallelism is the presence of conditional branches that determine which instructions need to be executed ne ..."
Abstract - Cited by 629 (0 self) - Add to MetaCart
One of the key factors determining computer performance is the degree to which the implementation can take advantage of instruction-level paral-lelism. Perhaps the most critical limit to this parallelism is the presence of conditional branches that determine which instructions need to be executed

Trace Scheduling: A Technique for Global Microcode Compaction

by Joseph A. Fisher - IEEE TRANSACTIONS ON COMPUTERS , 1981
"... Microcode compaction is the conversion of sequential microcode into efficient parallel (horizontal) microcode. Local com-paction techniques are those whose domain is basic blocks of code, while global methods attack code with a general flow control. Compilation of high-level microcode languages int ..."
Abstract - Cited by 683 (5 self) - Add to MetaCart
Microcode compaction is the conversion of sequential microcode into efficient parallel (horizontal) microcode. Local com-paction techniques are those whose domain is basic blocks of code, while global methods attack code with a general flow control. Compilation of high-level microcode languages
Results 1 - 10 of 30,166