Abstract Models

In this chapter, we study abstract models for both shared memory and message passing systems. We study several parallel and distributed algorithms and evaluate their complexities using these models. At first glance, abstract models may appear to be inappropriate in real‐world situations due to their...

Full description

Saved in:
Bibliographic Details
Published in:Advanced Computer Architecture and Parallel Processing pp. 127 - 155
Main Authors: El‐Rewini, Hesham, Abd‐El‐Barr, Mostafa
Format: Book Chapter
Language:English
Published: Hoboken, NJ, USA John Wiley & Sons, Inc 17.12.2004
Series:Wiley Series on Parallel and Distributed Computing
Subjects:
analysis of parallel algorithms
complexity analysis
computing sum and all sums
leader election problem
matrix multiplication
message passing model
parallel random access machine (PRAM) model
sorting
synchronous message passing model
ISBN:9780471467403, 0471467405
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract In this chapter, we study abstract models for both shared memory and message passing systems. We study several parallel and distributed algorithms and evaluate their complexities using these models. At first glance, abstract models may appear to be inappropriate in real‐world situations due to their idealistic nature. However, abstract machines have been very useful in studying parallel and distributed algorithms and evaluating their anticipated performance independent of the real machines. Clearly, if the performance of an algorithm is not satisfactory on an abstract system, it is meaningless to implement it on a real system. Although abstract models do not consider some practical considerations in real parallel and distributed systems, they focus on the computational aspects of the algorithmic complexity, which makes it less difficult to find performance bounds and complexity estimates. We begin by discussing a model of shared memory systems called PRAM (Parallel Random Access Machine). We also study the PRAM model and the relationships between its different variations. In addition, we present a computational model for synchronous message passing systems. Furthermore, we discuss complexity analysis of algorithms described in terms of both PRAM and message passing models. An assortment of algorithms for both models will be presented and evaluated.
AbstractList In this chapter, we study abstract models for both shared memory and message passing systems. We study several parallel and distributed algorithms and evaluate their complexities using these models. At first glance, abstract models may appear to be inappropriate in real‐world situations due to their idealistic nature. However, abstract machines have been very useful in studying parallel and distributed algorithms and evaluating their anticipated performance independent of the real machines. Clearly, if the performance of an algorithm is not satisfactory on an abstract system, it is meaningless to implement it on a real system. Although abstract models do not consider some practical considerations in real parallel and distributed systems, they focus on the computational aspects of the algorithmic complexity, which makes it less difficult to find performance bounds and complexity estimates. We begin by discussing a model of shared memory systems called PRAM (Parallel Random Access Machine). We also study the PRAM model and the relationships between its different variations. In addition, we present a computational model for synchronous message passing systems. Furthermore, we discuss complexity analysis of algorithms described in terms of both PRAM and message passing models. An assortment of algorithms for both models will be presented and evaluated.
Author El‐Rewini, Hesham
Abd‐El‐Barr, Mostafa
Author_xml – sequence: 1
  givenname: Hesham
  surname: El‐Rewini
  fullname: El‐Rewini, Hesham
– sequence: 2
  givenname: Mostafa
  surname: Abd‐El‐Barr
  fullname: Abd‐El‐Barr, Mostafa
BookMark eNptUE1LAzEQjaig1sWbZ__ArpNk8nUspbZCxYueQ7KZYHXpFlMo-uvdqrQIDjyGGd483rwLdrLqV8TYNYeGA4hbQMPRWGlV077oI1Y5Y_c7fXyYtUGQZ6wq5RWG4spZxc_Z1TiWzXtoNzcPfaKuXLLTHLpC1W8fsee76dNkXi8eZ_eT8aLeci1yHa3UAcmQiI67KERKNqjkwKYAWThhCYVDgyFhSwllipoIUJlgSOVWjlj9o7tddvThKfb9W_F_zPvP5doPT_l1ygO_-YfPwe9S8IcUvg8GyC9RW06G
ContentType Book Chapter
Copyright Copyright © 2005 John Wiley & Sons, Inc.
Copyright_xml – notice: Copyright © 2005 John Wiley & Sons, Inc.
DOI 10.1002/0471478385.ch6
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 9780471478386
0471478385
EndPage 155
ExternalDocumentID 10.1002/0471478385.ch6
Genre chapter
GroupedDBID 089
20A
38.
3W9
3X9
3XM
5VX
A4I
A4J
AABBV
AARDG
ABARN
ABIAV
ABIMR
ABQPQ
ABQPW
ACBYE
ACIQC
ACLGV
ACNAM
ADVEM
AERYV
AFOJC
AHWGJ
AIHSK
AIJWT
AIXPE
AJFER
ALMA_UNASSIGNED_HOLDINGS
AMYDA
AZZ
BBABE
BPBUR
CZZ
GEOUK
HF4
I90
IPJKO
J-X
JFSCD
KAH
MYL
PQQKQ
W1A
WIIVT
YPLAZ
YSPEL
ZEEST
ID FETCH-LOGICAL-w162f-b836a4e7e2b919b22dd8a5d908da0f2928e429474ad4ced43db6ee0457a7e5fc3
ISBN 9780471467403
0471467405
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000298231800007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Sat Nov 15 22:27:59 EST 2025
Wed Nov 27 04:56:33 EST 2019
IsPeerReviewed false
IsScholarly false
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-w162f-b836a4e7e2b919b22dd8a5d908da0f2928e429474ad4ced43db6ee0457a7e5fc3
PageCount 29
ParticipantIDs wiley_ebooks_10_1002_0471478385_ch6_ch6
PublicationCentury 2000
PublicationDate 2004-12-17
PublicationDateYYYYMMDD 2004-12-17
PublicationDate_xml – month: 12
  year: 2004
  text: 2004-12-17
  day: 17
PublicationDecade 2000
PublicationPlace Hoboken, NJ, USA
PublicationPlace_xml – name: Hoboken, NJ, USA
PublicationSeriesTitle Wiley Series on Parallel and Distributed Computing
PublicationTitle Advanced Computer Architecture and Parallel Processing
PublicationYear 2004
Publisher John Wiley & Sons, Inc
Publisher_xml – name: John Wiley & Sons, Inc
SSID ssj0000159851
ssj0000097639
Score 1.2863675
Snippet In this chapter, we study abstract models for both shared memory and message passing systems. We study several parallel and distributed algorithms and evaluate...
SourceID wiley
SourceType Enrichment Source
Publisher
StartPage 127
SubjectTerms analysis of parallel algorithms
complexity analysis
computing sum and all sums
leader election problem
matrix multiplication
message passing model
parallel random access machine (PRAM) model
sorting
synchronous message passing model
Title Abstract Models
URI https://onlinelibrary.wiley.com/doi/abs/10.1002/0471478385.ch6
WOSCitedRecordID wos000298231800007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LT8MwDI7G44CQeCPe2gHBARXa9JHkONAACTEmBBK3Km1SMWmUaRsPceGv4yRNtw4OcODQqquszK6j2IntzwjtM181D0g9JxESOwEYIIeGwneEn3naxrtpoJtNkFaLPjywdq32aWthXrskz-n7O-v9q6rhHShblc7-Qd3loPACnkHpcAe1w33CI66evZqcYxvSt90ajhqTkYI276v-KV1bI2Btl07gKHMfbuVbJzcdrVVQ6GkUJhIlzRj5Ke9r1V8_g7eZ8fGJ2EjUaUo61G3XusaFVx9CDuzapX-oqEXJms6PVpC-qhtXKY3l1B5SaChEU5NpDMj3LKBqqqfZzrpgKVX3E9cfW1I9gx1QWGfPgPp-W_gNkKwegFCfhsfp4wTCdrHl-Zl0Ck0RAsvkzEXz5v6qPKRTVS5RAZtq8MhCBi6qRjYoWA0tipNl3SKDuvik-h_V7Y_2X-6W0LyqaamrYhPgcxnVZL6CFu0cqRcL_CpasMqqG2Wtofvz5t3ZpVO0zHDevAhnTkL9iAeSSJwwjyUYC0F5KJhLBXczzDCV4IAEJOAigMkY-CKJpAS3nnAiwyz119F0_pzLDVTPojRMhce4K1zYw3sgOAfzyESIpQrWbaJDLU6so_qD2OBf43gkdAxCq2sTHVQo7edSRFH80elpwp7Itn495DaaG02zHTQ97L_IXTSbvg47g_5eocYvqPFY2Q
linkProvider ProQuest Ebooks
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.title=Advanced+Computer+Architecture+and+Parallel+Processing&rft.au=El%E2%80%90Rewini%2C+Hesham&rft.au=Abd%E2%80%90El%E2%80%90Barr%2C+Mostafa&rft.atitle=Abstract+Models&rft.series=Wiley+Series+on+Parallel+and+Distributed+Computing&rft.date=2004-12-17&rft.pub=John+Wiley+%26+Sons%2C+Inc&rft.isbn=9780471467403&rft.spage=127&rft.epage=155&rft_id=info:doi/10.1002%2F0471478385.ch6&rft.externalDocID=10.1002%2F0471478385.ch6
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780471467403/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780471467403/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780471467403/sc.gif&client=summon&freeimage=true