Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Parallel programming (Computer science) --- Parallelle programmering (Informatica) --- Programmation parallèle (Informatique) --- Parallel programming (Computer science).

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Parallel programming (Computer science) --- Programming languages (Electronic computers) --- Programmation parallèle (Informatique) --- Langages de programmation --- Congresses --- Semantics --- Congrès --- Sémantique --- Parallel programming (Computer science) - Congresses. --- Programming languages (Electronic computers) - Semantics - Congresses. --- Theoretical Computer Sci --- Ccs --- Temporal Logic --- Process --- Concurrency

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Computer architecture --- Computerarchitectuur --- Langages de programmation (Ordinateurs) --- Ordinateurs--Architecture --- Parallel programming (Computer science) --- Parallelle programmering (Informatica) --- Programmation parallèle (Informatique) --- Programmeertalen (Computers) --- Programming languages (Electronic computers) --- Langages de programmation --- Ordinateurs --- Architecture --- Computer architecture. --- Programming languages (Electronic computers). --- Parallel programming (Computer science). --- Programmation parallèle (Informatique) --- Petri Net --- Specification --- Functional Language --- Object Oriented --- Programming

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book contains papers presented at a workshop on the use of parallel techniques in symbolic and algebraic computation held at Cornell University in May 1990. The eight papers in the book fall into three groups. The first three papers discuss particular programming substrates for parallel symbolic computation, especially for distributed memory machines. The next three papers discuss novel ways of computing with elements of finite fields and with algebraic numbers. The finite field technique is especially interesting since it uses the Connection Machine, a SIMD machine, to achievesurprising amounts of parallelism. One of the parallel computing substrates is also used to implement a real root isolation technique. One of the crucial algorithms in modern algebraic computation is computing the standard, or Gr|bner, basis of an ideal. The final two papers discuss two different approaches to speeding their computation. One uses vector processing on the Cray and achieves significant speed-ups. The other uses a distributed memory multiprocessor and effectively explores the trade-offs involved with different interconnect topologies of the multiprocessors.

Algebra --- Parallel programming (Computer science) --- Parallel processing (Electronic computers) --- Data processing --- Congresses. --- -Parallel processing (Electronic computers) --- -Parallel programming (Computer science) --- -681.3*C4 --- 681.3*I1 --- Mathematics --- Mathematical analysis --- -Congresses --- Congresses --- Performance of systems (Computer systems organization) --- Algebraic manipulation (Computing methodologies) --- 681.3*I1 Algebraic manipulation (Computing methodologies) --- 681.3*C4 Performance of systems (Computer systems organization) --- 681.3*C4 --- Data processing&delete& --- Algebra - Data processing - Congresses. --- Parallel programming (Computer science) - Congresses. --- Computer network architectures. --- Algebra. --- Computer system performance. --- Algorithms. --- Numerical analysis. --- Computer System Implementation. --- Symbolic and Algebraic Manipulation. --- System Performance and Evaluation. --- Numerical Analysis. --- Data processing. --- Algorism --- Arithmetic --- Architectures, Computer network --- Network architectures, Computer --- Computer architecture --- Foundations --- Parallel processing (Electronic computers) - Congresses.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This monograph extends and generalizes the UNITY methodology, introduced in the late 1980s by K. Mani Chandy and Jayadev Misra as a formalism aiding in the specification and verification of parallel programs, in several directions. This treatise further develops the ideas behind UNITY in order to explore and understand the potential and limitations of this approach: first UNITY is applied to formulate and tackle problems in parallelism such as compositionality; second, the logic and notation of UNITY is generalized in order to increase its range of applicability; finally, paradigms and abstractions useful for the design of probabilistic parallel algorithms are developed. Taken together the results presented reaffirm the promise of UNITY as a versatile medium for treating many problems of parallelism.

Parallel programming (Computer science) --- Parallelle programmering (Informatica) --- Programmation parallèle (Informatique) --- Computer software --- Verification. --- Verification --- Parallel programming. --- Computer network architectures. --- Software engineering. --- Computer science. --- Logic design. --- Computer System Implementation. --- Software Engineering/Programming and Operating Systems. --- Programming Techniques. --- Software Engineering. --- Programming Languages, Compilers, Interpreters. --- Logics and Meanings of Programs. --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Machine theory --- Switching theory --- Informatics --- Science --- Computer software engineering --- Engineering --- Architectures, Computer network --- Network architectures, Computer --- Computer architecture --- Computer software - Verification.