Robert R. Seban

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

Demo Data from EDBT 2026 / reviewers in the wild / expert

dblp:85/844 · DBLP profile ↗

← Back

7ranked-venue papers

6as first author

0since 2021 · last 1995

—ORCID · none

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

Systems, architecture and hardware · 6 · 6 first-authorComputer networks · 1

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 architecture, parallel and distributed computing, and storage systems

1 paper

Interconnection networks and networks-on-chip · 50% Parallel and multicore computing · 50%

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

Topic	Weight	Papers	Last	Evidence papers
Parallel and multicore computing data permutation	0.0	1	1984	Shuffling with the Illiac and PM21 SIMD Networks · IEEE Trans. Computers 1984
Interconnection networks and networks-on-chip › interconnection networks SIMD interconnection network	0.0	1	1984	Shuffling with the Illiac and PM21 SIMD Networks · IEEE Trans. Computers 1984

Year	Publication	Venue	Position
1995	A Distributed Critical Section Protocol for General Topology Robert R. Seban	J. Parallel Distributed Comput.	1
1991	A General-Purpose, High Performance Algorithm for Distributed Systems Reliability Evaluation Anton P. Karadimce, Robert R. Seban, Aksenti L. Grnarov	Comput. Networks ISDN Syst.	2
1991	FTN Topology and Protocols Robert R. Seban	J. Parallel Distributed Comput.	1
1985	Analysis of Partitionability Properties of Topologically Arbitrary Interconnection Networks Robert R. Seban, Howard Jay Siegel	ICDCS	1
1984	Theoretical Modeling and Analysis of Special Purpose Interconnection Networks Robert R. Seban, Howard Jay Siegel	ICDCS	1
1984	Shuffling with the Illiac and PM21 SIMD Networks abstract Two SIMD single-stage interconnection networks which have been proposed and studied in the literature are the Illiac type and PM2I. The ability of the Illiac and PM2I networks to perform the shuffle data permutation in an SIMD machine with N processors is examined. Two algorithms for an SIMD or multiple-SIMD machine with the PM2I network to perform the shuffle are given. One algorithm is used in the event that the SIMD machine is of the same size (in terms of number of processors) as the shuffle to be emulated. The other algorithm is used when the shuffle to be performed is of smaller size than the given machine with the PM2I network. It is proven that both algorithms require only one more network transfer than the previously published lower bound (which is log2S for a shuffle on S elements). Using the PM2I algorithm as a basis, an algorithm for the Illiac to emulate the shuffle is given. Its performance is 2√N - 1 transfers which is only three transfers more than the previously published lower bound of 2√N - 4. Robert R. Seban, Howard Jay Siegel	IEEE Trans. Computers	1
1983	Performing the Shuffle with the PM2I and Illiac SIMD Interconnection Networks Robert R. Seban, Howard Jay Siegel	ICPP	1