G.C. Fox, M.A. Johnson, G.F. Lyzenga, S.W. Otto, J.K. Salmon and D.W. Walker, Solving Problems On Concurrent Processors (Prentice Hall, Englewood Cliffs, N. J., 1988). Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Compile-Time Estimation of Communication Costs in Multicomputers - Manish Gupta And (1993) (19 citations) (Correct)
....the difference of the two. Communication Primitives Our system uses array reference patterns to determine which communication routines out of a given library of routines best realize the required data movement. Much of the ideas on these collective communication routines come from Fox et al. [6]. We assume that the following communication routines are supported by the run time library: ffl Transfer : send a message from a single source to a single destination processor. ffl OneToManyMulticast : send a message to all processors along the specified dimension(s) of the processor grid. ....
....it. On the other hand, our results have interesting implications for how the generation of communication should be done by such compilers to reduce the communication overheads. The use of high level collective communication routines has been shown to be a good idea by a number of researchers [6]. We are currently exploring how synthesis of communication can be guided by the techniques we have developed. We have used a number of simplifying assumptions in our work that need to be relaxed in order to build a truly automated system for this task. Various loop bounds in the program and the ....
G. Fox, M. Johnson, G. Lyzenga, S. Otto, J. Salmon, and D. Walker. Solving Problems on Concurrent Processors. Prentice Hall, 1988.
c flCopyright by Manish Gupta, 1992 - Automatic Data Partitioning (Correct)
....the second step. 4.1 Communication Primitives This section describes the special primitives that are recognized by the compiler as appropriate for implementing the data movement in different parts of a program. Many of the early ideas on these routines came from Geoffrey Fox and his co workers [21], in the context of developing scientific application programs on multicomputers. Many researchers have looked at the problem of developing efficient algorithms for such primitives [32, 37] and obtaining parameterized 38 estimates for the performance of those primitives on specific machines [7, ....
....communication routine is carried out. The use of high level collective communication routines is becoming increasingly popular with application programmers on multicomputers. A number of such communication libraries have been developed, in some cases, as part of a broader research effort [56, 21, 16, 67]. 4.2 Characterization of Array References The communication requirements for an rhs array reference in a statement depend on the relationship between processors owning the elements corresponding to the rhs and the lhs 39 Transfer OneToManyMulticast ManyToManyMulticast Scatter Gather ....
G. Fox, M. Johnson, G. Lyzenga, S. Otto, J. Salmon, and D. Walker. Solving Problems on Concurrent Processors. Prentice Hall, 1988.
Software Tool Evaluation Methodology - Salim Hariri Sung-Yong (1995) (1 citation) Self-citation (Fox) (Correct)
No context found.
Geoffrey C. Fox., Mark A. Johnson., Gregory A. lyzenga., Steve W. Otto., John K. Salmon., David W. Walker., "Solving Problems on Concurrent Processors", New Jersey : Prentice Hall, November 1988.
Studies of Integration and Optimization of Interpreted and.. - Fox, Li, Wen, Zhang (1997) Self-citation (Fox) (Correct)
....other related activities and research results. Other related research topics There was active research in the early 70 s, as to whether a language would be best executed in interpreted or compiled form. People had well understood and agreed on the advantages and disadvantages of both. Reference [1] presents a typical analysis at that time. The basic conclusion was that interpreter was too slow to be widely useful. As microprocessors and personal computers became popular in late 70 s and early 80 s, use of an interpreter was once again favored by some people and applications. Reference [2] ....
Fox, G.C., Johnson, M.A., Lyzenga, G.A., Otto, S.W., Salmon, J.K., Walker, D.W., Solving Problems on Concurrent Processors, Vol. 1, Prentice-Hall, Inc. 1988.
Parallel computing on Unix workstation arrays - Reale Bocchino Sciortino (Correct)
No context found.
G.C. Fox, M.A. Johnson, G.F. Lyzenga, S.W. Otto, J.K. Salmon and D.W. Walker, Solving Problems On Concurrent Processors (Prentice Hall, Englewood Cliffs, N. J., 1988).
Process Variation Aware Parallelization Strategies - For Mpso Cs (2006) (Correct)
No context found.
G. Fox, M. Johnson, G. Lyzenga, S. Otto, J. Salmon and D. Walker. "Solving Problems on Concurrent Processors" Prentice-Hall, Englewood Cliffs, 1988.
CONCURRENCY: PRACTICE AND EXPERIENCE,VOL. 9(12).. - Applications In.. (Correct)
No context found.
G. C. Fox, M. A. Johnson, G. A. Lyzenga, S. W. Otto, J. K. Salmon and D. W. Walker, Solving Problems on Concurrent Processors, Vol. I, Prentice-Hall, 1988.
Mantis User's Guide, Version 1.0 - Steven Lumetta And (Correct)
No context found.
G. Fox, M. Johnson, G. Lyzenga, S. Otto, J. Salmon, D. Walker, "Solving Problems on Concurrent Processors," Vol. I, Ch. 17, pp. 307-325, Prentice Hall, Englewood Cliffs, New Jersey.
Fast Gossiping by Short Messages - Bermond, Gargano, al. (1995) (20 citations) (Correct)
No context found.
G. Fox, M. Johnsson, G. Lyzenga, S. Otto, J. Salmon, and D. Walker, Solving Problems on Concurrent Processors, Volume I, Prentice Hall, 1988.
Efficient Collective Communication in Optical Networks - Bermond, Gargano.. (35 citations) (Correct)
No context found.
G. Fox, M. Johnsson, G. Lyzenga, S. Otto, J. Salmon, and D. Walker, Solving Problems on Concurrent Processors, Volume I, Prentice Hall, Englewood Cliffs, NJ, 1988.
Optimal Sequential Gossiping by Short Messages - Bermond, Gargano, Perennes (1998) (7 citations) (Correct)
No context found.
G. Fox, M. Johnsson, G. Lyzenga, S. Otto, J. Salmon, and D. Walker, Solving Problems on Concurrent Processors, Volume I, Prentice Hall, 1988.
Parallel multigrid summation for the N-body problem - Izaguirre, Matthey (2004) (Correct)
No context found.
G. C. Fox, M. A. Johnson, G. A. Lyzenga, S. W. Otto, J. K. Salmon, D. W. Walker, Solving Problems on Concurrent Processors, Vol. 1, Prentice Hall, Englewood Cli#s, NJ, 1988.
Compiler and Run-Time Support for Semi-Structured.. - Chrisochoides.. (1997) (3 citations) (Correct)
No context found.
G. Fox, M. Johnson, G. Lyzenga, S. Otto, J. Salmon, and D. Walker. Solving problems on Concurrent Processors, volume 1. Prentice-Hall, Englewood Cliffs, New Jersey, 1988.
Patterns for Parallel Application Programs - Massingill, Mattson, Sanders (1999) (4 citations) (Correct)
No context found.
G. Fox, M. Johnson, G. Lyzenga, S. Otto, J. Salmon, and D. Walker. Solving Problems on Concurrent Processors. Prentice Hall, 1988.
Executing Algorithms with Hypercube Topology on Torus .. - Gonzalez.. (1995) (Correct)
No context found.
G. Fox et al., Solving Problems on Concurrent Processors, Englewood Cliffs, N.J.,Prentice-Hall, 1988.
Efficient Implementation of Sorting Algorithms on.. - Zhou, Brent, Tridgell (1993) (3 citations) (Correct)
No context found.
G. C. Fox, M. A. Johnson, G. A. Lyzenga, S. W. Otto, J. K. Salmon and D. W. Walker, Solving Problems on Concurrent Processors, Volume 1, Prentice-Hall, Englewood Cliffs, New Jersey, 1988.
An Implementation of a General-Purpose Parallel Sorting.. - Tridgell, Brent (1993) (14 citations) (Correct)
No context found.
G. C. Fox, M. A. Johnson, G. A. Lyzenga, S. W. Otto, J. K. Salmon and D. W. Walker, Solving Problems on Concurrent Processors, Volume 1, Prentice-Hall, Englewood Cli s, New Jersey, 1988.
Efficient Implementation of Sorting Algorithms on.. - Zhou, Brent, Tridgell (1993) (3 citations) (Correct)
No context found.
G. C. Fox, M. A. Johnson, G. A. Lyzenga, S. W. Otto, J. K. Salmon and D. W. Walker, Solving Problems on Concurrent Processors, Volume 1, Prentice-Hall, Englewood Cli s, New Jersey, 1988.
Conservative Scheduling: Using Predicted Variance to.. - Yang, Schopf, Foster (2003) (1 citation) (Correct)
No context found.
Fox, G.C., Johnson, M.A., Lyzenga, G.A., Otto, S.W., Salmon, J.K. and Walker, D.W., Solving Problems on Concurrent Processors, Prentice-Hall, 1988.
Efficient Implementation of Sorting Algorithms on.. - Zhou, Brent, Tridgell (1994) (3 citations) (Correct)
No context found.
G. C. Fox, M. A. Johnson, G. A. Lyzenga, S. W. Otto, J. K. Salmon and D. W. Walker, Solving Problems on Concurrent Processors, Volume 1, Prentice-Hall, Englewood Cli s, New Jersey, 1988.
Efficient Implementation of Sorting Algorithms on.. - Zhou, Brent, Tridgell (1994) (3 citations) (Correct)
No context found.
G. C. Fox, M. A. Johnson, G. A. Lyzenga, S. W. Otto, J. K. Salmon and D. W. Walker, Solving Problems on Concurrent Processors, Volume 1, Prentice-Hall, Englewood Cliffs, New Jersey, 1988.
System Sensitive Runtime Management of Dynamic Applications - Sinha (2001) (Correct)
No context found.
G.C. Fox, M. Johnson, D. Walker, "Solving problems on Concurrent processors, " Prentice Hall 1988.
A Fast, Storage-Efficient Parallel Sorting Algorithm - Brent, Tridgell (1993) (Correct)
No context found.
G. C. Fox, M. A. Johnson, G. A. Lyzenga, S. W. Otto, J. K. Salmon and D. W. Walker, Solving Problems on Concurrent Processors, Volume 1, Prentice-Hall, Englewood Cli s, New Jersey, 1988.
Approximation Algorithms for Array Partitioning Problems - Muthukrishnan Torsten Suel (Correct)
No context found.
G. Fox, M. Johnson, G. Lyzenga, S. Otto, J. Salmon, and D. Walker. Solving Problems on Concurrent Processors, volume 1. Prentice-Hall, Englewood Cliffs, New Jersey, 1988.
Compile-Time Estimation of Communication Costs for - Data Parallel Programs (1997) (Correct)
No context found.
G. Fox, M. Johnson, G. Lyzenga, S. Otto, J. Salmon, and D. Walker. Solving Problems on Concurrent Processors, volume 1. and 2. Prentice Hall, Englewood Cliffs, NY, 1988.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC