Fault tolerant algorithms for a linear array with a reconfigurable pipelined bus system

Recently, researchers have proposed many models using reconfigurable optically pipelined buses. All algorithms developed for these models assume that a healthy system is available. We present some fundamental algorithms that are able to tolerate up to N/2 faults on an N-processor, linear array with...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Parallel algorithms and applications Ročník 18; číslo 3; s. 139 - 153
Hlavní autoři: Bourgeois, Anu G., Trahan¶§, Jerry L.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Taylor & Francis Group 01.09.2003
Témata:
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 Recently, researchers have proposed many models using reconfigurable optically pipelined buses. All algorithms developed for these models assume that a healthy system is available. We present some fundamental algorithms that are able to tolerate up to N/2 faults on an N-processor, linear array with a reconfigurable pipelined bus system (LARPBS) (one particular optical model). We then extend these results to apply to other algorithms in the areas of image processing and matrix operations.
AbstractList Recently, researchers have proposed many models using reconfigurable optically pipelined buses. All algorithms developed for these models assume that a healthy system is available. We present some fundamental algorithms that are able to tolerate up to N/2 faults on an N-processor, linear array with a reconfigurable pipelined bus system (LARPBS) (one particular optical model). We then extend these results to apply to other algorithms in the areas of image processing and matrix operations.
Author Bourgeois, Anu G.
Trahan¶§, Jerry L.
Author_xml – sequence: 1
  givenname: Anu G.
  surname: Bourgeois
  fullname: Bourgeois, Anu G.
  email: abourgeois@cs.gsu.edu
  organization: Department of Computer Science , Georgia State University, University Plaza
– sequence: 2
  givenname: Jerry L.
  surname: Trahan¶§
  fullname: Trahan¶§, Jerry L.
  organization: Department of Electrical and Computer Engineering , Louisiana State University
BookMark eNqFkMFOwzAMhnMYEtvgCbjkBQpJ07XNBQlNDJAmcQFxrNw0GUFpMzmZRt-eTOyEJnay9duff-ufkcngB03IDWe3nNXsjrNSVFwywRljnBVSlhMyPahZkvNLMgvhK40kL8SUfKxg5yKN3mmEIVJwG482fvaBGo8UqLODhtQgwkj3aZI01MoPxm52CK3TdGu3-rDW0XYXaBhD1P0VuTDggr4-1jl5Xz2-LZ-z9evTy_Jhnam8rGImF0YaSN_WpoCFqEQtlE59V5q2hDyvFryrGasLgDLPgQkFYIpCgVaGdS0XcyJ_7yr0IaA2jbIRovVDRLCu4aw5pNKcSCWx4g-7RdsDjmeoo6MdUkI97D26rokwOo8mZahsOMU18Tsm9v4sK_4z_wHnK4_G
CitedBy_id crossref_primary_10_1016_j_jpdc_2004_11_002
crossref_primary_10_1109_TPDS_2009_68
Cites_doi 10.1109/71.706044
10.1006/jnca.1996.0016
10.1109/71.642947
10.1109/12.57055
10.1109/71.914767
10.1109/12.485379
10.1142/S0129626498000304
10.1109/ICPP.1996.537386
10.1016/0743-7315(91)90130-2
10.1109/71.808130
10.1007/3-540-45591-4_144
10.1016/0167-739X(94)00066-N
10.1006/jpdc.2000.1643
10.1109/IPDPS.2000.846060
10.1142/S012962649500045X
10.1145/129712.129729
10.1109/MWSCAS.1993.343286
10.1049/ip-cdt:19951621
10.1016/S0020-0255(97)10013-5
10.1117/1.601593
10.1080/01495739808947358
10.1109/IPPS.1998.670010
10.1080/10637199608915554
10.1007/b102253
10.1109/12.223677
10.1006/jpdc.1994.1143
10.1109/12.247834
10.1007/978-1-4615-5611-4_34
ContentType Journal Article
Copyright Copyright Taylor & Francis Group, LLC 2003
Copyright_xml – notice: Copyright Taylor & Francis Group, LLC 2003
DBID AAYXX
CITATION
DOI 10.1080/1063719031000104996
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EndPage 153
ExternalDocumentID 10_1080_1063719031000104996
9612597
GroupedDBID .7F
.QJ
0BK
123
29O
4.4
AAGDL
AALDU
AAMIU
AAPUL
AAQRR
ABCCY
ABDBF
ABFIM
ABJNI
ABLIJ
ABPAQ
ABPEM
ABXUL
ABXYU
ACTIO
ACTTO
ACUHS
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
CAG
CCCUG
CE4
COF
CS3
CYRSC
DAOYK
DGEBU
DKSSO
EAP
EBS
EJD
EMK
EPL
EST
ESX
E~A
E~B
H13
HF~
IPNFZ
KYCEM
M4Z
OPCYK
RIG
RNANH
ROSJB
RTWRZ
S-T
SNACF
TAJZE
TASJS
TBQAZ
TDBHL
TEN
TFL
TFT
TFW
TNC
TTHFI
TUROJ
TUS
UT5
UU3
ZGOLN
~S~
07I
4B5
AAYXX
ADXEU
AEHZU
AEZBV
AGBLW
AGYFW
AKHJE
AKMBP
ALXIB
BGSSV
C0-
C5H
CITATION
DEXXA
FETWF
IFELN
L8C
TAP
UB6
ID FETCH-LOGICAL-c267t-95f9fa1908f4a537383ce8f4d6fb6a22751d80084aa622a03caaf44caecf0db13
IEDL.DBID TFW
ISSN 1063-7192
IngestDate Sat Nov 29 03:14:03 EST 2025
Tue Nov 18 22:36:14 EST 2025
Mon Oct 20 23:44:05 EDT 2025
Mon May 13 12:09:12 EDT 2019
IsPeerReviewed false
IsScholarly false
Issue 3
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c267t-95f9fa1908f4a537383ce8f4d6fb6a22751d80084aa622a03caaf44caecf0db13
PageCount 15
ParticipantIDs informaworld_taylorfrancis_310_1080_1063719031000104996
crossref_primary_10_1080_1063719031000104996
crossref_citationtrail_10_1080_1063719031000104996
PublicationCentury 2000
PublicationDate 9/1/2003
2003-09-00
PublicationDateYYYYMMDD 2003-09-01
PublicationDate_xml – month: 09
  year: 2003
  text: 9/1/2003
  day: 01
PublicationDecade 2000
PublicationTitle Parallel algorithms and applications
PublicationYear 2003
Publisher Taylor & Francis Group
Publisher_xml – name: Taylor & Francis Group
References bib14
bib15
bib12
bib34
bib13
bib35
bib10
bib32
bib11
bib33
bib30
bib31
bib29
bib27
bib28
bib25
bib26
bib23
bib24
bib21
bib22
bib20
bib9
bib7
bib8
bib5
bib18
bib6
bib19
bib3
bib16
bib4
bib17
bib1
bib2
References_xml – ident: bib16
  doi: 10.1109/71.706044
– ident: bib17
– ident: bib20
  doi: 10.1006/jnca.1996.0016
– ident: bib29
  doi: 10.1109/71.642947
– ident: bib3
  doi: 10.1109/12.57055
– ident: bib6
  doi: 10.1109/71.914767
– ident: bib7
  doi: 10.1109/12.485379
– ident: bib31
  doi: 10.1142/S0129626498000304
– ident: bib13
– ident: bib26
  doi: 10.1109/ICPP.1996.537386
– ident: bib32
– ident: bib34
– ident: bib8
– ident: bib11
  doi: 10.1016/0743-7315(91)90130-2
– ident: bib1
  doi: 10.1109/71.808130
– ident: bib4
  doi: 10.1007/3-540-45591-4_144
– ident: bib19
  doi: 10.1016/0167-739X(94)00066-N
– ident: bib30
  doi: 10.1006/jpdc.2000.1643
– ident: bib5
  doi: 10.1109/IPDPS.2000.846060
– ident: bib18
– ident: bib9
– ident: bib27
  doi: 10.1142/S012962649500045X
– ident: bib2
  doi: 10.1145/129712.129729
– ident: bib23
  doi: 10.1109/MWSCAS.1993.343286
– ident: bib12
  doi: 10.1049/ip-cdt:19951621
– ident: bib21
  doi: 10.1016/S0020-0255(97)10013-5
– ident: bib35
  doi: 10.1117/1.601593
– ident: bib22
  doi: 10.1080/01495739808947358
– ident: bib24
  doi: 10.1109/IPPS.1998.670010
– ident: bib25
  doi: 10.1080/10637199608915554
– ident: bib14
  doi: 10.1007/b102253
– ident: bib28
  doi: 10.1109/12.223677
– ident: bib10
  doi: 10.1006/jpdc.1994.1143
– ident: bib33
  doi: 10.1109/12.247834
– ident: bib15
  doi: 10.1007/978-1-4615-5611-4_34
SSID ssj0009143
Score 1.3411685
Snippet Recently, researchers have proposed many models using reconfigurable optically pipelined buses. All algorithms developed for these models assume that a healthy...
SourceID crossref
informaworld
SourceType Enrichment Source
Index Database
Publisher
StartPage 139
SubjectTerms Fault tolerant algorithms
Optical buses
Reconfigurable models
Title Fault tolerant algorithms for a linear array with a reconfigurable pipelined bus system
URI https://www.tandfonline.com/doi/abs/10.1080/1063719031000104996
Volume 18
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAWR
  databaseName: Taylor and Francis Online Journals
  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/eLvHCXMwpV3NS8MwFA8yPHhxfuL8IgePBtYkbdqjiMXT8DDZbiVNk1mY22hT0f_eJE11g7GDnhpKX_Ka5vXlPV5-PwDupMwTErICkSSUiJodLIpjmiDJqJGwMYYQjmyCjUbxdJq8eJ7T2pdV2hhatUAR7l9tjZvndVcRZ64RYcaRudx0YPfsFnLbOH5rmON08gu6G_gC-4ggI4A71KHtfWx4pg3c0jWPk_b_resROPSbTfjQro5jsCcXJ6DfETlAb9enYJLyZq6hXs6lcV0a8vlsWZX67b2GRj3IoR2Ym0ZV8S9oU7fmngulVTlrKnv6Cq7KlT3aLguYNzVsAaLPwGv6NH58Rp5xAQkcMY2SUCWKG3VjRXloQY-IkKZdRCqPOMYsDIrYQvBzHmHMh0RwrigVXAo1LPKAnIPeYrmQFwAWxvliElKphH3rMBZhQZjAgmJlOlEDgLvZzoSHI7esGPMs8KilW6ZuAO5_hFYtGsfux_H6Z8y0S4KolrFkm0CmP_UAsB1CZMdwl3-WvAIHrkjQ1a5dg56uGnkD9sWHLuvq1i3qb6VM8gA
linkProvider Taylor & Francis
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV07T8MwED5BQYKF8hTl6YGRSI0d5zEiRFREqRiK2i1yHLtUCm2VOgj-PXYe0EpVB5hiRfnsi2PnfKe77wBuhIgDQr3EIgEVlqNPsJbvO4ElPEcjjI3BeVFswuv1_OEweFnI4jdhlcaGliVRRPGvNpvbOKPrkDh9dYmnNVnhnLbNod3dhC2qNa1hz--Hg1_aXbsKsXeJpRG45h1a3cmSblpiLl3QOWHz_9Luw1513kR35QI5gA0xOYRmXcsBVVv7CAYhy1OF1DQVWnspxNLRNBurt_c50vIhhszITDeyjH0h473V9wprWo5HeWYSsNBsPDPZ7SJBcT5HJUf0MbyGD_37jlUVXbA4dj1lBVQGkmlxfekwaniPCBe6nbgydhnGHrUT37DwM-ZizNqEMyYdhzPBZTuJbXICjcl0Ik4BJVr_YkIdIbl5a-pzmhCPY-5gqTuRLcD1dEe8YiQ3hTHSyK6IS1dMXQtuf0CzkpBj_eN48TtGqvCDyLJoySpApD5VC7w1ILJmuLM_I69hp9N_7kbdx97TOewWMYNFKNsFNFSWi0vY5h9qPM-uihX-DQT29io
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1bS8MwFD7oFPHFuzivefDRwpr0-ihqUZSxh8n2VtI0mYW6lTYV_fcmvegGYw_61FB6ktM06blw8n0A15xHPrHd2CC-zQ1LebCG51m-wV1LSegYg7GKbMLt973x2B80PKdFU1apY2hRA0VU_2q9ubNYtBVx6uoQVxmyKjdtap_dWYcN5Tg7eokPg9Ev6q7ZVNg7xFASuIUdWt7JgmlaAC6dMznB7r-V3YOdxttEt_Xy2Ic1Pj2A3ZbJATUb-xBGAS1TieQs5cp2SUTTySxP5Nt7gZR6iCI9MFWNPKdfSOdu1b0qlhbJpMz18SuUJZk-285jFJUFqhGij-A1eBjePRoN5YLBsONKw7eFL6hS1xMWtTXqEWFctWNHRA7F2LXN2NMY_JQ6GNMeYZQKy2KUM9GLI5McQ2c6m_ITQLGyvpjYFhdMv7XtMTsmLsPMwkJ1IrqA29kOWYNHrmkx0tBsYEuXTF0Xbn6EshqOY_XjeP4zhrLKgoiasmSZQCg_ZRfcFUJkxXCnf5a8gq3BfRC-PPWfz2C7Khis6tjOoSPzkl_AJvuQSZFfVuv7Gx4K9Nw
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=Fault+tolerant+algorithms+for+a+linear+array+with+a+reconfigurable+pipelined+bus+system&rft.jtitle=Parallel+algorithms+and+applications&rft.au=Bourgeois%2C+Anu+G.&rft.au=Trahan%C2%B6%C2%A7%2C+Jerry+L.&rft.date=2003-09-01&rft.issn=1063-7192&rft.volume=18&rft.issue=3&rft.spage=139&rft.epage=153&rft_id=info:doi/10.1080%2F1063719031000104996&rft.externalDBID=n%2Fa&rft.externalDocID=10_1080_1063719031000104996
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