Matches in SemOpenAlex for { <https://semopenalex.org/work/W3147883864> ?p ?o ?g. }
Showing items 1 to 69 of
69
with 100 items per page.
- W3147883864 abstract "The maximum matching algorithm for bipartite graphs can be used to provide optimal scheduling for crossbar based interconnection networks. Unfortunately, maximum matching requires O(N <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>3</sup> ) time for an N times N communication system, which has limited its application to real-time network scheduling. In this paper, we show how maximum matching can be reformulated in terms of Boolean operations rather than the more traditional formulations. By taking advantage of the inherent parallelism available in custom hardware design, we introduce three maximum matching implementations in hardware and show how we can trade design complexity for performance. Specifically, we examine a pure logic scheduler with three dimensions of parallelism, a matrix scheduler with two dimensions of parallelism and a vector scheduler with one dimension of parallelism. These designs reduce the algorithmic time complexity down to O(1), O(K), and O(KN), respectively, where K is the number of optimization steps. While an optimal scheduling algorithm requires K=2N-1 steps, our simulation results show that the scheduler can achieve 99% of the optimal schedule when K=9. We examine hardware and time complexity of these architectures for crossbar sizes of up to N=1024. Using FPGA synthesis results, we show that a greedy schedule for various sized crossbars, ranging from 8 times 8 to 256 times 256, can be optimized in less than 20 ns per optimization step. For crossbars reaching 1024 times 1024 the scheduling can be completed in approximately 10 s with current technology and could reach under 90 ns with future technologies" @default.
- W3147883864 created "2021-04-13" @default.
- W3147883864 creator A5021064313 @default.
- W3147883864 creator A5075192470 @default.
- W3147883864 creator A5077141420 @default.
- W3147883864 date "2006-11-01" @default.
- W3147883864 modified "2023-09-25" @default.
- W3147883864 title "A Near-optimal Real-time Hardware Scheduler for Large Cardinality Crossbar Switches" @default.
- W3147883864 cites W1981234161 @default.
- W3147883864 cites W2001005029 @default.
- W3147883864 cites W2031966632 @default.
- W3147883864 cites W2080090262 @default.
- W3147883864 cites W2090168101 @default.
- W3147883864 cites W2096392353 @default.
- W3147883864 cites W2125241096 @default.
- W3147883864 cites W2149236102 @default.
- W3147883864 doi "https://doi.org/10.1109/sc.2006.3" @default.
- W3147883864 hasPublicationYear "2006" @default.
- W3147883864 type Work @default.
- W3147883864 sameAs 3147883864 @default.
- W3147883864 citedByCount "3" @default.
- W3147883864 countsByYear W31478838642013 @default.
- W3147883864 crossrefType "proceedings-article" @default.
- W3147883864 hasAuthorship W3147883864A5021064313 @default.
- W3147883864 hasAuthorship W3147883864A5075192470 @default.
- W3147883864 hasAuthorship W3147883864A5077141420 @default.
- W3147883864 hasConcept C11413529 @default.
- W3147883864 hasConcept C124101348 @default.
- W3147883864 hasConcept C126255220 @default.
- W3147883864 hasConcept C132525143 @default.
- W3147883864 hasConcept C173608175 @default.
- W3147883864 hasConcept C197657726 @default.
- W3147883864 hasConcept C206729178 @default.
- W3147883864 hasConcept C29984679 @default.
- W3147883864 hasConcept C33923547 @default.
- W3147883864 hasConcept C41008148 @default.
- W3147883864 hasConcept C76155785 @default.
- W3147883864 hasConcept C80444323 @default.
- W3147883864 hasConcept C87117476 @default.
- W3147883864 hasConceptScore W3147883864C11413529 @default.
- W3147883864 hasConceptScore W3147883864C124101348 @default.
- W3147883864 hasConceptScore W3147883864C126255220 @default.
- W3147883864 hasConceptScore W3147883864C132525143 @default.
- W3147883864 hasConceptScore W3147883864C173608175 @default.
- W3147883864 hasConceptScore W3147883864C197657726 @default.
- W3147883864 hasConceptScore W3147883864C206729178 @default.
- W3147883864 hasConceptScore W3147883864C29984679 @default.
- W3147883864 hasConceptScore W3147883864C33923547 @default.
- W3147883864 hasConceptScore W3147883864C41008148 @default.
- W3147883864 hasConceptScore W3147883864C76155785 @default.
- W3147883864 hasConceptScore W3147883864C80444323 @default.
- W3147883864 hasConceptScore W3147883864C87117476 @default.
- W3147883864 hasLocation W31478838641 @default.
- W3147883864 hasOpenAccess W3147883864 @default.
- W3147883864 hasPrimaryLocation W31478838641 @default.
- W3147883864 hasRelatedWork W1509211761 @default.
- W3147883864 hasRelatedWork W1558545464 @default.
- W3147883864 hasRelatedWork W1984303163 @default.
- W3147883864 hasRelatedWork W2117014006 @default.
- W3147883864 hasRelatedWork W2149712598 @default.
- W3147883864 hasRelatedWork W2358725432 @default.
- W3147883864 hasRelatedWork W2372170743 @default.
- W3147883864 hasRelatedWork W2953390393 @default.
- W3147883864 hasRelatedWork W4233815414 @default.
- W3147883864 hasRelatedWork W4301329442 @default.
- W3147883864 isParatext "false" @default.
- W3147883864 isRetracted "false" @default.
- W3147883864 magId "3147883864" @default.
- W3147883864 workType "article" @default.