Matches in SemOpenAlex for { <https://semopenalex.org/work/W3040209743> ?p ?o ?g. }
Showing items 1 to 87 of
87
with 100 items per page.
- W3040209743 endingPage "72" @default.
- W3040209743 startingPage "63" @default.
- W3040209743 abstract "Reconfiguring a high-performance subarray of a VLSI array with faults is to construct a maximum target array with the minimum number of long interconnects, which can reduce communication costs, capacitance and dynamic energy dissipation. An existing work proved that the high performance VLSI subarray can be constructed in polynomial time using network flow algorithm. However, because of the disadvantage of the previous network model and the low-performing of standard network flow algorithms for reconfiguration, the efficiency of these algorithms is poor for constructing the high performance VLSI subarray. In this paper, we present an efficient multiple shortest augmenting paths algorithm for rapidly constructing high performance VLSI array. Firstly, we proposed an efficient data structure to construct the network model of the VLSI array with faults, which can dramatically reduce the size of the model compared with previous algorithm. Secondly, a multiple shortest augmenting path algorithm based on the new data structure is proposed, which can significant reduce the running time. Finally, we conduct solid experiments to highlight the efficiency of the proposed method in terms of the running time compared to the standard network flow algorithms. The experimental results show that on a 64 × 64 host array with 0.1% faults, the size of the network model can be reduced by about 50% and the average improvements in running time is up to 85.10% compared with four standard network flow algorithms." @default.
- W3040209743 created "2020-07-10" @default.
- W3040209743 creator A5001859368 @default.
- W3040209743 creator A5012329541 @default.
- W3040209743 creator A5016209518 @default.
- W3040209743 creator A5029879407 @default.
- W3040209743 creator A5039734214 @default.
- W3040209743 creator A5048849816 @default.
- W3040209743 date "2020-11-01" @default.
- W3040209743 modified "2023-10-14" @default.
- W3040209743 title "An efficient multiple shortest augmenting paths algorithm for constructing high performance VLSI subarray" @default.
- W3040209743 cites W1981282359 @default.
- W3040209743 cites W1985574589 @default.
- W3040209743 cites W2002792327 @default.
- W3040209743 cites W2004622965 @default.
- W3040209743 cites W2007899044 @default.
- W3040209743 cites W2040066907 @default.
- W3040209743 cites W2044637290 @default.
- W3040209743 cites W2071424492 @default.
- W3040209743 cites W2117482747 @default.
- W3040209743 cites W2146393011 @default.
- W3040209743 cites W2148706425 @default.
- W3040209743 cites W2152312767 @default.
- W3040209743 cites W2162584664 @default.
- W3040209743 cites W2171918708 @default.
- W3040209743 cites W2344157501 @default.
- W3040209743 cites W2766153290 @default.
- W3040209743 cites W2905163486 @default.
- W3040209743 doi "https://doi.org/10.1016/j.vlsi.2020.06.005" @default.
- W3040209743 hasPublicationYear "2020" @default.
- W3040209743 type Work @default.
- W3040209743 sameAs 3040209743 @default.
- W3040209743 citedByCount "4" @default.
- W3040209743 countsByYear W30402097432021 @default.
- W3040209743 countsByYear W30402097432022 @default.
- W3040209743 crossrefType "journal-article" @default.
- W3040209743 hasAuthorship W3040209743A5001859368 @default.
- W3040209743 hasAuthorship W3040209743A5012329541 @default.
- W3040209743 hasAuthorship W3040209743A5016209518 @default.
- W3040209743 hasAuthorship W3040209743A5029879407 @default.
- W3040209743 hasAuthorship W3040209743A5039734214 @default.
- W3040209743 hasAuthorship W3040209743A5048849816 @default.
- W3040209743 hasConcept C11413529 @default.
- W3040209743 hasConcept C119701452 @default.
- W3040209743 hasConcept C132525143 @default.
- W3040209743 hasConcept C14580979 @default.
- W3040209743 hasConcept C149635348 @default.
- W3040209743 hasConcept C173608175 @default.
- W3040209743 hasConcept C173870130 @default.
- W3040209743 hasConcept C22590252 @default.
- W3040209743 hasConcept C311688 @default.
- W3040209743 hasConcept C41008148 @default.
- W3040209743 hasConcept C80444323 @default.
- W3040209743 hasConceptScore W3040209743C11413529 @default.
- W3040209743 hasConceptScore W3040209743C119701452 @default.
- W3040209743 hasConceptScore W3040209743C132525143 @default.
- W3040209743 hasConceptScore W3040209743C14580979 @default.
- W3040209743 hasConceptScore W3040209743C149635348 @default.
- W3040209743 hasConceptScore W3040209743C173608175 @default.
- W3040209743 hasConceptScore W3040209743C173870130 @default.
- W3040209743 hasConceptScore W3040209743C22590252 @default.
- W3040209743 hasConceptScore W3040209743C311688 @default.
- W3040209743 hasConceptScore W3040209743C41008148 @default.
- W3040209743 hasConceptScore W3040209743C80444323 @default.
- W3040209743 hasFunder F4320321001 @default.
- W3040209743 hasFunder F4320322768 @default.
- W3040209743 hasFunder F4320323266 @default.
- W3040209743 hasLocation W30402097431 @default.
- W3040209743 hasOpenAccess W3040209743 @default.
- W3040209743 hasPrimaryLocation W30402097431 @default.
- W3040209743 hasRelatedWork W2025399802 @default.
- W3040209743 hasRelatedWork W2083717798 @default.
- W3040209743 hasRelatedWork W2229183064 @default.
- W3040209743 hasRelatedWork W2359847778 @default.
- W3040209743 hasRelatedWork W2372473202 @default.
- W3040209743 hasRelatedWork W2375280931 @default.
- W3040209743 hasRelatedWork W2385402343 @default.
- W3040209743 hasRelatedWork W2391048224 @default.
- W3040209743 hasRelatedWork W2810620529 @default.
- W3040209743 hasRelatedWork W3183360588 @default.
- W3040209743 hasVolume "75" @default.
- W3040209743 isParatext "false" @default.
- W3040209743 isRetracted "false" @default.
- W3040209743 magId "3040209743" @default.
- W3040209743 workType "article" @default.