PARADIGMS ADMITTING SUPERUNITARY BEHAVIOUR IN PARALLEL COMPUTATION

With the expanding role of computers in society, some assumptions underlying well known theorems in the theory of parallel computation no longer hold universally. In particular, the speedup theorem and Brent's theorem do not apply to dynamic computers that interact with their environment. The p...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Parallel algorithms and applications Ročník 11; číslo 1-2; s. 129 - 153
Hlavní autoři: AKL, S. G., LINDON, L. FAVA
Médium: Journal Article
Jazyk:angličtina
Vydáno: Taylor & Francis Group 01.01.1997
Témata:
1.2.9 (Robotics)
Brent's theorem
F.1.1 (Models of Computation)
F.1.2 (Modes of Computation)
F.2.2 (Nonnumerical Algorithms and Problems)
G.3 (Probability and Statistics)
parallel computation
speedup theorem
superlinear speedup
superunitary speedup
ISSN:1063-7192
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract With the expanding role of computers in society, some assumptions underlying well known theorems in the theory of parallel computation no longer hold universally. In particular, the speedup theorem and Brent's theorem do not apply to dynamic computers that interact with their environment. The phenomenon of a disproportionate decrease in execution time of P 2 over p 1 processors for p 2 > p 1 is referred to as superunitary speedup. An analogous phenomenon that we call superunilary 'success ratio' occurs in dealing with tasks that can either succeed or fail, when there is a disproportionate increase in the success of p2 over p1 processors executing a task. We identify a range of conditions that may lead to superunitary speedup or success ratio, and propose several new paradigms for problems that admit such superunitary behaviour. Our results suggest that a new theory of parallel computation may be required to accommodate these new paradigms.
AbstractList With the expanding role of computers in society, some assumptions underlying well known theorems in the theory of parallel computation no longer hold universally. In particular, the speedup theorem and Brent's theorem do not apply to dynamic computers that interact with their environment. The phenomenon of a disproportionate decrease in execution time of P 2 over p 1 processors for p 2 > p 1 is referred to as superunitary speedup. An analogous phenomenon that we call superunilary 'success ratio' occurs in dealing with tasks that can either succeed or fail, when there is a disproportionate increase in the success of p2 over p1 processors executing a task. We identify a range of conditions that may lead to superunitary speedup or success ratio, and propose several new paradigms for problems that admit such superunitary behaviour. Our results suggest that a new theory of parallel computation may be required to accommodate these new paradigms.
Author LINDON, L. FAVA
AKL, S. G.
Author_xml – sequence: 1
  givenname: S. G.
  surname: AKL
  fullname: AKL, S. G.
  organization: Dept. of Computing and Information Science , Queen's University at Kingston
– sequence: 2
  givenname: L. FAVA
  surname: LINDON
  fullname: LINDON, L. FAVA
  organization: Dept. of Mathematics and Computer Science , Laurentian University
BookMark eNqFz8tqwkAUBuBZWKjaPkB3eYG0M04uM9DNqKkOxERiUugqTOYCKTEpk0D17avYVQW7OvBzvsP5J2DUdq0G4AnBZwQJfEEwwCGiNISEIt-naATG58w9hbN7MOn7TwghRR4eg_mWZWzJV5udw5Ybnuc8WTm7YhtlRcJzln0482jN3nlaZA5PnPN2HEexs0g32yJnOU-TB3BnRNPrx985BcVblC_Wbpyu-ILFrkQUIdcoSSpFvMqDRmpifC316T1CEPYgVZ4PjTKBEr6aqSCoDDaoqoQX6kpQYxTFUxBe7krb9b3VppT1IIa6awcr6qZEsDzXL6_qnyT6I79svRf2eNO8Xkzdms7uxXdnG1UO4th01ljRyrov8S0e_suvVDkcBvwD72KAzg
CitedBy_id crossref_primary_10_1023_A_1011179823237
crossref_primary_10_1080_17445760_2019_1570193
crossref_primary_10_1006_jpdc_2000_1707
crossref_primary_10_1080_1206212X_2003_11441712
Cites_doi 10.1016/0167-8191(86)90024-4
10.1002/j.1097-024X.1986.tb00009.x
10.1145/75104.75105
10.1109/TC.1986.5009434
10.1142/S0129626492000167
10.1016/0743-7315(91)90008-W
10.1007/978-3-642-96878-5
10.1016/0304-3975(92)90271-G
10.1093/oso/9780195078817.001.0001
10.1145/358080.358103
10.1016/0167-8191(87)90053-6
10.1016/S0167-8191(05)80060-2
10.1007/3-540-18991-2_58
10.1145/321812.321815
10.1016/0167-8191(86)90025-6
10.1007/3-540-17943-7_132
10.1109/71.219757
10.1109/71.86112
ContentType Journal Article
Copyright Copyright Taylor & Francis Group, LLC 1997
Copyright_xml – notice: Copyright Taylor & Francis Group, LLC 1997
DBID AAYXX
CITATION
DOI 10.1080/10637199708915591
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EndPage 153
ExternalDocumentID 10_1080_10637199708915591
8915591
GroupedDBID .7F
.QJ
0BK
4.4
AAGDL
AALDU
AAMIU
AAPUL
AAQRR
ABCCY
ABFIM
ABJNI
ABLIJ
ABPAQ
ABPEM
ABXUL
ABXYU
ACTIO
ACTTO
ADCVX
ADGTB
AEISY
AFBWG
AFION
AFRVT
AGDLA
AGMYJ
AGVKY
AGWUF
AHDZW
AIJEM
AIYEW
AKBVH
AKOOK
ALMA_UNASSIGNED_HOLDINGS
ALQZU
ALRRR
AQRUH
AQTUD
AVBZW
BLEHA
BWMZZ
CCCUG
CE4
CS3
CYRSC
DAOYK
DGEBU
DKSSO
EBS
EJD
ESX
E~A
E~B
H13
HF~
KYCEM
M4Z
OPCYK
RNANH
ROSJB
RTWRZ
S-T
SNACF
TAJZE
TASJS
TBQAZ
TDBHL
TEN
TFL
TFT
TFW
TNC
TTHFI
TUROJ
UT5
UU3
ZGOLN
~S~
07I
123
29O
4B5
AAYXX
ABDBF
ACUHS
ADXEU
AEHZU
AEZBV
AGBLW
AGYFW
AKHJE
AKMBP
ALXIB
BGSSV
C0-
C5H
CAG
CITATION
COF
DEXXA
EAP
EMK
EPL
EST
FETWF
IFELN
IPNFZ
L8C
RIG
TAP
TUS
UB6
ID FETCH-LOGICAL-c1911-fdc8bd84b40fce8f5ece9158813409d450fdf6da5d2d66bf3f1bba47eba9ffd93
IEDL.DBID TFW
ISSN 1063-7192
IngestDate Sat Nov 29 02:32:47 EST 2025
Tue Nov 18 21:28:35 EST 2025
Mon May 13 12:09:12 EDT 2019
Mon Oct 20 23:33:58 EDT 2025
IsPeerReviewed false
IsScholarly false
Issue 1-2
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c1911-fdc8bd84b40fce8f5ece9158813409d450fdf6da5d2d66bf3f1bba47eba9ffd93
PageCount 25
ParticipantIDs crossref_citationtrail_10_1080_10637199708915591
crossref_primary_10_1080_10637199708915591
informaworld_taylorfrancis_310_1080_10637199708915591
PublicationCentury 1900
PublicationDate 1/1/1997
1997-01-00
PublicationDateYYYYMMDD 1997-01-01
PublicationDate_xml – month: 01
  year: 1997
  text: 1/1/1997
  day: 01
PublicationDecade 1990
PublicationTitle Parallel algorithms and applications
PublicationYear 1997
Publisher Taylor & Francis Group
Publisher_xml – name: Taylor & Francis Group
References CIT0010
CIT0031
CIT0012
Helmbold D. P. (CIT0014) 1989
Jájá J. (CIT0015) 1992
Akl S. G. (CIT0001) 1989
Cormen T. H. (CIT0005) 1990
Cole R. (CIT0004) 1989; 81
Sehneck P. B. (CIT0029) 1986; 16
Reif J. H. (CIT0028) 1993
Hatcher P. J. (CIT0013) 1991
Karp R. M. (CIT0017) 1990
Wirth N. (CIT0034) 1985
Tanenbaum A. S. (CIT0032) 1990
CIT0016
CIT0018
Fava Lindon L. (CIT0009) 1996
Debest X. A. (CIT0006) 1995; 38
Leighton F. T. (CIT0019) 1992
CIT0021
CIT0020
CIT0023
CIT0022
Gibbons A. (CIT0011) 1988
CIT0003
CIT0025
CIT0002
CIT0024
CIT0027
Smith J. R. (CIT0030) 1993
CIT0007
Quinn M. J. (CIT0026) 1987
CIT0008
Wakerly J. F. (CIT0033) 1989
References_xml – volume-title: Introduction to Algorithms.
  year: 1990
  ident: CIT0005
– volume-title: An Introduction to Parallel Algorithms
  year: 1992
  ident: CIT0015
– ident: CIT0007
  doi: 10.1016/0167-8191(86)90024-4
– volume-title: Designing Efficient Algorithms for Parallel Computers
  year: 1987
  ident: CIT0026
– volume: 16
  start-page: 781
  year: 1986
  ident: CIT0029
  publication-title: Software Practice Experience
  doi: 10.1002/j.1097-024X.1986.tb00009.x
– volume-title: The Design and Analysis of Parallel Algorithms.
  year: 1989
  ident: CIT0001
– ident: CIT0021
  doi: 10.1145/75104.75105
– ident: CIT0020
  doi: 10.1109/TC.1986.5009434
– ident: CIT0008
  doi: 10.1142/S0129626492000167
– ident: CIT0012
  doi: 10.1016/0743-7315(91)90008-W
– volume-title: Programming in Modula-2
  year: 1985
  ident: CIT0034
  doi: 10.1007/978-3-642-96878-5
– ident: CIT0002
  doi: 10.1016/0304-3975(92)90271-G
– volume-title: The Design and Analysis of Parallel Algorithms.
  year: 1993
  ident: CIT0030
  doi: 10.1093/oso/9780195078817.001.0001
– volume-title: Efficient Parallel Algorithm's.
  year: 1988
  ident: CIT0011
– ident: CIT0018
  doi: 10.1145/358080.358103
– ident: CIT0016
  doi: 10.1016/0167-8191(87)90053-6
– volume: 38
  start-page: 115
  year: 1995
  ident: CIT0006
  publication-title: Comm. ACM
– volume: 81
  start-page: 334
  year: 1989
  ident: CIT0004
  publication-title: Information and Control
– volume-title: Structured Computer Organization.
  year: 1990
  ident: CIT0032
– volume-title: Microcomputer Architecture and Programming
  year: 1989
  ident: CIT0033
– volume-title: Synthesis of Parallel Algorithms
  year: 1993
  ident: CIT0028
– start-page: 869
  volume-title: Handbook of Theoretical Computer Science
  year: 1990
  ident: CIT0017
– ident: CIT0010
  doi: 10.1016/S0167-8191(05)80060-2
– ident: CIT0031
  doi: 10.1007/3-540-18991-2_58
– volume-title: Dept. of Computing and Information Science
  year: 1996
  ident: CIT0009
– start-page: 219
  volume-title: Proc. International Conference on Parallel Processing
  year: 1989
  ident: CIT0014
– ident: CIT0003
  doi: 10.1145/321812.321815
– ident: CIT0025
  doi: 10.1016/0167-8191(86)90025-6
– volume-title: Introduction to Parallel Alogorithms and Architectures Arrays, Trees, Hypercubes
  year: 1992
  ident: CIT0019
– ident: CIT0024
– ident: CIT0022
– ident: CIT0023
  doi: 10.1007/3-540-17943-7_132
– ident: CIT0027
  doi: 10.1109/71.219757
– volume-title: Data-Parallel Programming on MIMD Computers
  year: 1991
  ident: CIT0013
  doi: 10.1109/71.86112
SSID ssj0009143
Score 1.250676
Snippet With the expanding role of computers in society, some assumptions underlying well known theorems in the theory of parallel computation no longer hold...
SourceID crossref
informaworld
SourceType Enrichment Source
Index Database
Publisher
StartPage 129
SubjectTerms 1.2.9 (Robotics)
Brent's theorem
F.1.1 (Models of Computation)
F.1.2 (Modes of Computation)
F.2.2 (Nonnumerical Algorithms and Problems)
G.3 (Probability and Statistics)
parallel computation
speedup theorem
superlinear speedup
superunitary speedup
Title PARADIGMS ADMITTING SUPERUNITARY BEHAVIOUR IN PARALLEL COMPUTATION
URI https://www.tandfonline.com/doi/abs/10.1080/10637199708915591
Volume 11
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAWR
  databaseName: Taylor & Francis Journals Complete
  issn: 1063-7192
  databaseCode: TFW
  dateStart: 19930101
  customDbUrl:
  isFulltext: true
  dateEnd: 20041231
  titleUrlDefault: https://www.tandfonline.com
  omitProxy: false
  ssIdentifier: ssj0009143
  providerName: Taylor & Francis
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8NAEF5EPHixPrG-2IMnIZBk8zymbdoG2jSkidZTyL5AkCptFH--u3loS7UHPeUykyyTnZn9ZodvALg1MRZpjQp0oruWYiBsKVhEQYUZru0yV6fEIeWwCTsMndnMjerenGXdVikxNK-IIspYLZ07x8umI048LWTLBgnVKdnNJfgRaV-6ZdJ_-Kbc1er2egspQlxv7jR_esNaVlrjLF3JNv3WP9d5CA7qYyb0qn1xBHbY_Bi0mhEOsPboE9CJvNjrBYPxFHo9EcaSIBzAaRr5sQCGiRc_wo4_9O6DSRrDIIRSejTyR7A7GUdpUta3TkHa95PuUKnHKihEgDNN4cL-mDoGNlROmMNNRphYn-NoSIA9apgqp9yiuUl1almYI65hnBs2w7nLOXXRGdidv8zZOYBUnNcQY7kmab1wTl3GqY4sMycGpwZ32kBtzJqRmnNcjr54zrSamnTDRm1w96XyWhFubBNWV_9VVpRVDl6NJNkUz4qPog3MLSro109d_FHvEuxXjLeyanMFdovFG7sGe-S9eFoubsod-wmuq-I0
linkProvider Taylor & Francis
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT4NAEN4YNdGL9Rnrcw-eTEiA5XmkLW2JlBJKtZ4Iy-4mJqaaFo0_310e2qbag564zMBmHzP7DZPvA-BGx5inNcLRiWobkoawIWEeBSWq2aZNbZVkVlaITZhBYE0mdlgV3OZVW6XA0KwkiihitTjcohhdt8Txp4FM0SEhWwW9OUc_WzrPs4I7P-4-fJPuKlWDvYEkbq_WfzV_esVSXlpiLV3IN93Gf0e6D_aqmyZ0yq1xADbo9BA0ahUHWB3qI9AKncjpeL3BCDodHsliL-jB0Th0I44NYyd6hC2379x7w3EEvQAKa993fdgeDsJxXJS4jsG468btvlQpK0gZx2eKxPgSYGJpWJNZRi2m04zy8VmWgjjeI5ouM8IMkupEJYaBGWIKxqlmUpzajBEbnYDN6cuUngJI-JUNUZoqgtkLp8SmjKjI0NNMY0RjVhPI9bwmWUU7LtQvnhOlYiddmaMmuP1yeS05N9YZy4uLleRFoYOVqiSr5kn-kTeBvsYF_fqpsz_6XYOdfjzwE98L7s7BbkmAK4o4F2Azn73RS7CdvedP89lVsX0_ASMD5l4
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT8MwDI7QQIgL4ynGMwdOSJXaJs3aY_eu6Lqq62CcqqZJJCQ0pq0gfj7pY7BpsAOcerHbKHFsf671GYBbg1IZ1phEJ7pFFIwoUaj0ggrHVt3ils4SM8mHTdQ9zxyPLb_szZmXbZUZhhYFUUTuq7PLPWVi0REnnwTVswYJ1czZzSX42ZZpM8kMPOw8fnPuamV_PUGKlNcXPzV_esVKWFohLV0KN53qPxd6APbLPBPahWEcgi0-OQLVxQwHWF7pY9Dw7cBuOd3-ENot6cdCx-vC4chvBxIZhnbwBBvtnv3gDEYBdDyYSbtu24XNQd8fhXmB6wSMOu2w2VPKuQpKItGZpgh5AJSZmGJVJNwUBk-4XJ9pakiiPYYNVTBBWGwwnRFCBRIapTGucxpbQjALnYLK5HXCzwBkMmFDnMdaxutFY2ZxwXREjDjBgmFh1oC62NYoKUnHs9kXL5FWcpOu7VEN3H2pTAvGjU3C6vJZRWle5hDFTJJ18Sj9SGvA2KCCfv3U-R_1bsCu3-pEruPdX4C9gv02q-Bcgko6e-NXYCd5T5_ns-vceD8BbezlEA
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%3Ajournal&rft.genre=article&rft.atitle=PARADIGMS+ADMITTING+SUPERUNITARY+BEHAVIOUR+IN+PARALLEL+COMPUTATION&rft.jtitle=Parallel+algorithms+and+applications&rft.au=AKL%2C+S.+G.&rft.au=LINDON%2C+L.+FAVA&rft.date=1997-01-01&rft.pub=Taylor+%26+Francis+Group&rft.issn=1063-7192&rft.volume=11&rft.issue=1-2&rft.spage=129&rft.epage=153&rft_id=info:doi/10.1080%2F10637199708915591&rft.externalDocID=8915591
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1063-7192&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1063-7192&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1063-7192&client=summon