Some new algorithms for reconfiguring VLSI/WSI arrays

Deals with the issue of reconfiguring processor arrays in the presence of faulty processors and fixed hardware resources. The models discussed consist of a set of identical Processing Elements (PEs) embedded in a flexible interconnection structure that is configured in the form of a rectangular grid...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:1990 proceedings s. 229 - 235
Hlavní autoři: Varvarigou, T., Roychowdhury, V.P., Kailath, T.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE Comput. Soc. Press 1990
Témata:
ISBN:9780818690136, 0818690135
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 Deals with the issue of reconfiguring processor arrays in the presence of faulty processors and fixed hardware resources. The models discussed consist of a set of identical Processing Elements (PEs) embedded in a flexible interconnection structure that is configured in the form of a rectangular grid. Furthermore in order to incorporate fault tolerance a given array has a pre-determined distribution of spare PEs. The general issue in reconfiguration is to replace faulty non-spare PEs by healthy spare ones, subject to given hardware constraints. The authors present some new algorithms for reconfiguring N*(N+1) arrays (where the spare PEs are configured in the form of a spare row) into N*N arrays when N of the PEs are faulty. The algorithms developed are simple and perform better than other reconfiguration algorithms presented in the literature.< >
AbstractList Deals with the issue of reconfiguring processor arrays in the presence of faulty processors and fixed hardware resources. The models discussed consist of a set of identical Processing Elements (PEs) embedded in a flexible interconnection structure that is configured in the form of a rectangular grid. Furthermore in order to incorporate fault tolerance a given array has a pre-determined distribution of spare PEs. The general issue in reconfiguration is to replace faulty non-spare PEs by healthy spare ones, subject to given hardware constraints. The authors present some new algorithms for reconfiguring N*(N+1) arrays (where the spare PEs are configured in the form of a spare row) into N*N arrays when N of the PEs are faulty. The algorithms developed are simple and perform better than other reconfiguration algorithms presented in the literature.< >
Author Varvarigou, T.
Roychowdhury, V.P.
Kailath, T.
Author_xml – sequence: 1
  givenname: T.
  surname: Varvarigou
  fullname: Varvarigou, T.
  organization: Inf. Syst. Lab., Stanford Univ., CA, USA
– sequence: 2
  givenname: V.P.
  surname: Roychowdhury
  fullname: Roychowdhury, V.P.
  organization: Inf. Syst. Lab., Stanford Univ., CA, USA
– sequence: 3
  givenname: T.
  surname: Kailath
  fullname: Kailath, T.
  organization: Inf. Syst. Lab., Stanford Univ., CA, USA
BookMark eNotj01LxDAYhAMqqLu96y1_oN2kb9MmRyl-FAoequtxSbZvamSbSrIi--8N6lxmYOAZ5pqc-8UjITecFZwztenat6EruFKsqEExcUYy1UgmuawV41BfkizGD5ZUCVGV4oqIYZmRevym-jAtwR3f50jtEmjA_eKtm76C8xPd9kO3SWyqQ9CnuCYXVh8iZv--Iq8P9y_tU94_P3btXZ873vBjXhsolam0kdo2ZVqshU0FKlkZA9BgNabAx5Kbxgg92tFaA2IvAZQpAWFFbv-4DhF3n8HNOpx2v9fgB94TRYU
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ICWSI.1990.63905
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE/IET Electronic Library (IEL) (UW System Shared)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EndPage 235
ExternalDocumentID 63905
GroupedDBID 6IE
6IK
6IL
AAJGR
AAWTH
ACGHX
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
OCL
RIB
RIC
RIE
RIL
ID FETCH-LOGICAL-i171t-6b329b4ab8af7255465f171e984bb337e4d4bb1d21b7b5adfdffb35c8339b23e3
IEDL.DBID RIE
ISBN 9780818690136
0818690135
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=63905&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Tue Aug 26 17:05:09 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i171t-6b329b4ab8af7255465f171e984bb337e4d4bb1d21b7b5adfdffb35c8339b23e3
PageCount 7
ParticipantIDs ieee_primary_63905
PublicationCentury 1900
PublicationDate 19900000
PublicationDateYYYYMMDD 1990-01-01
PublicationDate_xml – year: 1990
  text: 19900000
PublicationDecade 1990
PublicationTitle 1990 proceedings
PublicationTitleAbbrev ICWSI
PublicationYear 1990
Publisher IEEE Comput. Soc. Press
Publisher_xml – name: IEEE Comput. Soc. Press
SSID ssj0000455425
Score 1.2070926
Snippet Deals with the issue of reconfiguring processor arrays in the presence of faulty processors and fixed hardware resources. The models discussed consist of a set...
SourceID ieee
SourceType Publisher
StartPage 229
SubjectTerms Contracts
Fault tolerance
Hardware
Logic arrays
Management information systems
Reconfigurable architectures
Semiconductor device modeling
Switches
Very large scale integration
Wafer scale integration
Title Some new algorithms for reconfiguring VLSI/WSI arrays
URI https://ieeexplore.ieee.org/document/63905
WOSCitedRecordID wos63905&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/eLvHCXMwlV1LSwMxEA5aPHjSYsU3OXjddpNsNsm5WCxIKdRHbyVpJrVgu7JtBf-9s9laEbx4y4uQF8yXSb5vCLm1gTGfOpvkjockY04khnOdBA8gPKBNCXWwCTUY6PHYDLcyOZELAwDx8xm0q2R8y_fFdFO5yjpoTSu50n2lVM3U2nlTEJhIPH1R4LEOsiTkVl7nO797pExNp999GfUrol7ajn3-Cq0SLUvv6D9jOiatH4IeHe5MT5PswfKEyFGxAIowmdq3WYGX_tfFiiImpfHSG-azyEikzw-jfgcHRm1Z2s9Vizz17h6798k2KkIyZ4qtcVEFNy6zTtugePXJTAasAKMz54RQkHlMMM-ZU05aH3wITsipFsI4LkCcksayWMIZoRrBILaDHEFGFlLrHEimQRgtdJ5beU6a1YQn77XwxSTO9eKvwktyWK1m7Zu4Io11uYFrcjD9WM9X5U3cqy-LYpEX
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3LSgMxFA1SBV1pseLbLNxOO3nNJOticbCWQqt2V5LmphZsR6at4N-bydSK4MZdXoS84J7c5JyL0K12hNjY6Cgx1EWcGBYpSmXkLACz4G2Kq4JNpL2eHI1UfyOTE7gwABA-n0GzTIa3fJtP1qWrrOWtaSlXuis4p6Tiam39KR6aCH_-gsRjFWaJiY3Aznd--0wZq1bWfhlkJVUvboZefwVXCbalc_ifUR2hxg9FD_e3xqeOdmBxjMQgnwP2QBnrt2nur_2v8yX2qBSHa6-bTQMnET93B1nLDwzrotCfywZ66twN2_fRJi5CNCMpWfllZVQZro3ULqXlNzPhfAUoyY1hLAVufYJYSkxqhLbOOmeYmEjGlKEM2AmqLfIFnCIsPRz07SDxMIO7WBsDgkhgSjKZJFqcoXo54fF7JX0xDnM9_6vwBu3fDx-7427We7hAB-XKVp6KS1RbFWu4QnuTj9VsWVyHffsCTnKUXg
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=proceeding&rft.title=1990+proceedings&rft.atitle=Some+new+algorithms+for+reconfiguring+VLSI%2FWSI+arrays&rft.au=Varvarigou%2C+T.&rft.au=Roychowdhury%2C+V.P.&rft.au=Kailath%2C+T.&rft.date=1990-01-01&rft.pub=IEEE+Comput.+Soc.+Press&rft.isbn=9780818690136&rft.spage=229&rft.epage=235&rft_id=info:doi/10.1109%2FICWSI.1990.63905&rft.externalDocID=63905
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818690136/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818690136/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818690136/sc.gif&client=summon&freeimage=true