Results 1  10
of
1,398
MPI: A MessagePassing Interface Standard
, 1994
"... process naming to allow libraries to describe their communication in terms suitable to their own data structures and algorithms, ffl The ability to "adorn" a set of communicating processes with additional userdefined attributes, such as extra collective operations. This mechanism should ..."
Abstract

Cited by 402 (0 self)
 Add to MetaCart
Contexts of communication, ffl Groups of processes, ffl Virtual topologies, ffl Attribute caching, ffl Commun...
LogGP: Incorporating Long Messages into the LogP Model  One step closer towards a realistic model for parallel computation
, 1995
"... We present a new model of parallel computationthe LogGP modeland use it to analyze a number of algorithms, most notably, the single node scatter (onetoall personalized broadcast). The LogGP model is an extension of the LogP model for parallel computation [CKP + 93] which abstracts the comm ..."
Abstract

Cited by 288 (1 self)
 Add to MetaCart
We present a new model of parallel computationthe LogGP modeland use it to analyze a number of algorithms, most notably, the single node scatter (onetoall personalized broadcast). The LogGP model is an extension of the LogP model for parallel computation [CKP + 93] which abstracts the communication of fixedsized short messages through the use of four parameters: the communication latency (L), overhead (o), bandwidth (g), and the number of processors (P ). As evidenced by experimental data, the LogP model can accurately predict communication performance when only short messages are sent (as on the CM5) [CKP + 93, CDMS94]. However, many existing parallel machines have special support for long messages and achieve a much higher bandwidth for long messages compared to short messages (e.g., IBM SP2, Paragon, Meiko CS2, Ncube/2). We extend the basic LogP model with a linear model for long messages. This combination, which we call the LogGP model of parallel computation, has o...
The analogues of entropy and of Fisher’s information measure in free probability theory
 I. Comm. Math. Phys
, 1993
"... Dedicated to Huzuhiro Araki Abstract. Analogues of the entropy and Fisher information measure for random variables in the context of free probability theory are introduced. Monotonicity properties and an analogue of the CramerRao inequality are proved. ..."
Abstract

Cited by 261 (12 self)
 Add to MetaCart
Dedicated to Huzuhiro Araki Abstract. Analogues of the entropy and Fisher information measure for random variables in the context of free probability theory are introduced. Monotonicity properties and an analogue of the CramerRao inequality are proved.
Communication over fading channels with delay constraints
 IEEE Transactions on Information Theory
, 2002
"... We consider a user communicating over a fading channel with perfect channel state information. Data is assumed to arrive from some higher layer application and is stored in a buffer until it is transmitted. We study adapting the user's transmission rate and power based on the channel state info ..."
Abstract

Cited by 246 (7 self)
 Add to MetaCart
We consider a user communicating over a fading channel with perfect channel state information. Data is assumed to arrive from some higher layer application and is stored in a buffer until it is transmitted. We study adapting the user's transmission rate and power based on the channel state information as well as the buffer occupancy; the objectives are to regulate both the longterm average transmission power and the average buffer delay incurred by the traffic. Two models for this situation are discussed; one corresponding to fixedlength/variablerate codewords and one corresponding to variablelength codewords. The tradeoff between the average delay and the average transmission power required for reliable communication is analyzed. A dynamic programming formulation is given to find all Pareto optimal power/delay operating points. We then quantify the behavior of this tradeoff in the regime of asymptotically large delay. In this regime we characterize simple buffer control policies which exhibit optimal characteristics. Connections to the delaylimited capacity and the expected capacity of fading channels are also discussed.
Implementing Mathematics with The Nuprl Proof Development System
, 1986
"... Problem solving is a significant part of science and mathematics and is the most intellectually significant part of programming. Solving a problem involves understanding the problem, analyzing it, exploring possible solutions, writing notes about intermediate results, reading about relevant methods, ..."
Abstract

Cited by 190 (18 self)
 Add to MetaCart
Problem solving is a significant part of science and mathematics and is the most intellectually significant part of programming. Solving a problem involves understanding the problem, analyzing it, exploring possible solutions, writing notes about intermediate results, reading about relevant methods, checking results, and eventually assembling a solution. Nuprl is a computer system which provides assistance with this activity. It supports the interactive creation of proofs, formulas, and terms in a formal theory of mathematics
SSH  Secure Login Connections over the Internet
 In Proceedings of the 6th USENIX Security Symposium
, 1996
"... SSH provides secure login, file transfer, X11, and TCP/IP connections over an untrusted network. It uses cryptographic authentication, automatic session encryption, and integrity protection for transferred data. RSA is used for key exchange and authentication, and symmetric algorithms (e.g., IDEA or ..."
Abstract

Cited by 160 (0 self)
 Add to MetaCart
the most economical means for communication between two remote sites. Its uses include commun...
Spectral Analysis Of Rank One Perturbations And Applications
 LECTURE GIVEN AT THE VANCOUVER SUMMER SCHOOL IN MATHEMATICAL PHYSICS, AUGUST 1014, 1993.
, 1994
"... A review of the general theory of selfadjoint operators of the form A+ ffB where B is rank one is presented. Applications include proofs of localization for Schrodinger operators, results on inverse spectral theory, and examples of operators with singular continuous spectrum. ..."
Abstract

Cited by 161 (30 self)
 Add to MetaCart
A review of the general theory of selfadjoint operators of the form A+ ffB where B is rank one is presented. Applications include proofs of localization for Schrodinger operators, results on inverse spectral theory, and examples of operators with singular continuous spectrum.
MPI: A MessagePassing Interface Standard
, 1994
"... process naming to allow libraries to describe their communication in terms suitable to their own data structures and algorithms, ffl The ability to "adorn" a set of communicating processes with additional userdefined attributes, such as extra collective operations. This mechanism should ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Contexts of communication, ffl Groups of processes, ffl Virtual topologies, ffl Attribute caching, ffl Commun...
Results 1  10
of
1,398