Parallel computation model logPQ

  • Takayoshi Touyama
  • Susumu Horiguchi
VII Poster Session Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1336)


We propose a parallel computation model LogPQ by taking account of the communication queue into the LogP model. We assume that the message length is fixed and the three parameters SQ, RQ and TQ indicate the capacities of the sending queue, the receiving queue, and the transport channel queue, respectively. Since real parallel machines avoid the overflow of communication queues by using hardware, the message queue management takes up a lot of time in every communication. A parallel computation model should take into account the flow of processor communications. The LogPQ model considers the message length, and the communication queue management depended on its physical restriction in contrast with the LogP model. First, the LogP model is analyzed to show the requirements of the processor communication. We propose the LogPQ model by taking account of the communication requirement in parallel computers. To evaluate the accuracy of the LogPQ model, we compare with the LogP model for the behavior of parallel matrix multiplication algorithm on CM5.


parallel computers parallel computation model LogP model 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    “nCUBE2: Technical Overview”, nCUBE Corporation (1992).Google Scholar
  2. 2.
    “Connection Machine CM-5 Technical Summary”, Thinking Machines Corporation (1992).Google Scholar
  3. 3.
    William J.Dally, Andrew Chien, Stuart Fiske, Waldemar Horwat, John Keen, Michael Larivee, Rich Lethin, Peter Nuth and Scott Wills, “The J-Machine: A Fine-Grain Concurrent Computer”, Information Processing 89, pp.1147–1153 (1989).Google Scholar
  4. 4.
    Thorsten von Eicken, David E.Culler, Seth Copen Goldstein and Klaus Erik Schauseret, “Active Messages: a Mechanism for Integrated Communication and Computation”, Proceeding of the 19th Annual International Symposium on Computer Architecture pp.256–266 (1992).Google Scholar
  5. 5.
    Takeshi Horie, Youichi Koyanagi, Nobutaka Imamura, Kenichi Hayashi, Toshiyuki Shimizu and Hiroaki Ishihata, “Effect of Message Communication on DistributedMemory Parallel Computer Performance (in Japanese)”, Transactions of IPSJ, Vol.35 No.4, pp.609–618 (1994).Google Scholar
  6. 6.
    David Culler, Richard Karp, David Pattersom, Abhijit Sahay, Klaus Erik Schauser, Eunice Santos, Ramesh Subramonian and Thorsten von Eicken, “LogP: Towards a Realistic Model of Parallel Computation”, Proceeding of the 4th ACM SIGPLAN Symposium on Principles and Parallel Programming (1993).Google Scholar
  7. 7.
    Vipin Kumar, Ananth Grama, Anshul Gupta and George Karypis, “Introduction to Parallel Computing”, Benjamin/Cummings Publishing (1994).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Takayoshi Touyama
    • 1
  • Susumu Horiguchi
    • 1
  1. 1.Graduate School of Information ScienceJapan advanced Institute of Science and TechnologyJapan

Personalised recommendations