Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Amir Gourgy

dblp:91/1145 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2009
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 3 · 2 first-authorSystems, architecture and hardware · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
2 papers
Routing and switching · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Routing and switching
switch scheduling
0.222009
On tracking the behavior of an output-queued switch using an input-queued switch · IEEE/ACM Trans. Netw. 2009
Cooperative Token-Ring Scheduling For Input-Queued Switches · IEEE Trans. Computers 2009
Routing and switching › switch scheduling
input-queued switch scheduling
0.112009
Cooperative Token-Ring Scheduling For Input-Queued Switches · IEEE Trans. Computers 2009
Routing and switching
router architecture
0.112009
Cooperative Token-Ring Scheduling For Input-Queued Switches · IEEE Trans. Computers 2009

Methods — techniques the papers use, named apart from their topics

round-robin arbitration · 0.2hierarchical scheduling · 0.2hardware complexity analysis · 0.2
YearPublicationVenuePosition
2009 Cooperative Token-Ring Scheduling For Input-Queued Switches
abstract
We present a novel distributed scheduling paradigm for Internet routers with input-queued (IQ) switches, called cooperative token-ring (CTR) that provides significant performance improvement over existing scheduling schemes with comparable complexity. Many classical schedulers for IQ switches employ round-robin arbiters, which can be viewed as non-cooperative token-rings, where a separate token is used to resolve contention for each shared resource (e.g., an output port) and each input port acquires a token oblivious of the state of other input ports. Although classical round-robin scheduling schemes achieve fairness and high throughput for uniform traffic, under non-uniform traffic the performance degrades significantly. We show that by using a simple cooperative mechanism between the otherwise non-cooperative arbiters, the performance can be significantly improved. The CTR scheduler dynamically adapts to non-uniform traffic patterns and achieves essentially 100% throughput. The proposed cooperative mechanism is conceptually simple and is supported by experimental results. To provide adequate support for rate guarantees in IQ switches, we present a weighted cooperative token-ring, a simple hierarchical scheduling mechanism. Finally, we analyze the hardware complexity introduced by the cooperative mechanism and describe an optimal hardware implementation for an N times N switch with time complexity of Theta(log N) and circuit size of Theta(N log N) per port.
Amir Gourgy, Ted H. Szymanski
IEEE Trans. Computers1
2009 On tracking the behavior of an output-queued switch using an input-queued switch
Amir Gourgy, Ted H. Szymanski, Douglas G. Down
IEEE/ACM Trans. Netw.1
2005 Power complexity of multiplexer-based optoelectronic crossbar switches
abstract
The integration of thousands of optical input/output (I/O) devices and large electronic crossbar switching elements onto a single optoelectronic integrated circuit (IC) can place stringent power demands on the CMOS substrates. Currently, there is no sufficiently general analytic methodology for power analysis and power reduction of large-scale crossbar switching systems. An analysis of the power complexity of single-chip optoelectronic switches is presented, assuming the classic broadcast-and-select crossbar architecture. The analysis yields the distribution of power dissipation and allows for design optimization. Both unpipelined and pipelined designs are analyzed, and a technique to reduce power dissipation significantly is proposed. The design of a 5.12 Tbit single-chip optoelectronic switch using 0.18-/spl mu/m CMOS technology is illustrated. The pipelined switch design occupies < 70 mm/sup 2/ of CMOS area, and consumes <80 W of power, which compares favorably to the power required in electrical crossbar switches of equivalent capacity.
Ted H. Szymanski, Amir Gourgy
IEEE Trans. Very Large Scale Integr. Syst.3
2004 Credit-based fair scheduling for input-queued switches
abstract
We present a novel scheduling algorithm for Internet routers with input-queued switches based on credit-based fair queueing. We present a flow-based iterative credit-based fair scheduler (iCBFS) for crossbar switches, that provides fair bandwidth distribution among flows at a fine granularity and achieves asymptotically 100% throughput, under uniform traffic. To reduce the implementation complexity of iCBFS, we present a port-based version of iCBFS that is tailored towards high-speed hardware implementation.
Amir Gourgy, Ted H. Szymanski
ICC1
2003 An Optoelectronic Multi-Terabit CMOS Switch Core for Local Area Networks
abstract
Optoelectronic integrated circuits can support thousands of integrated optical laser diodes and photodetectors bonded to a high-performance CMOS substrate, and can be used in the design of multi-Terabit optical local area networks. This paper describes the design of an integrated optoelectronic CMOS crossbar switch to interconnect approx. 128 parallel fiber ribbon optical links, each with 12 channels clocked at 2.5 Gigabit/sec, to achieve a local area network (LAN) with an aggregate capacity of 3.84 Terabits/second. A prototype switch core has been designed in 0.18 /spl mu/m CMOS technology. Logic optimization and synthesis was performed using the synopsis logic optimization tools, and VLSI layout was performed using the Cadence 2002 tools. It is shown that using 0.18 /spl mu/m CMOS technology, a 3.84 Terabit crossbar switch for an optoelectronic LAN occupies approx. 1.78 sq. cm of real estate, and consumes approx. 90 watts of power.
Amir Gourgy, Ted H. Szymanski
LCN2