#### Filter Results:

- Full text PDF available (35)

#### Publication Year

1983

2017

- This year (1)
- Last 5 years (3)
- Last 10 years (14)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Ching-Yi Lee, A. Yavuz Oruç
- IEEE Trans. Parallel Distrib. Syst.
- 1995

Absftact-This paper presents a new parallel algorithm for routing unicast (one-to-one) assignments in Ben& networks. Parallel routing algorithms for such networks were reported earlier, but these algorithms were designed primarily to route permutation assignments. The routing algorithm presented in this paper removes this restriction without an increase in… (More)

- Weiming Guo, A. Yavuz Oruç
- IEEE Trans. Computers
- 1998

A bipartite concentrator is a single stage sparse crossbar switching device that can connect any m of its n ≥ m inputs to its m outputs possibly without the ability to distinguish their order. Fat-and-slim crossbars were introduced recently to show that bipartite concentrators can be constructed with a minimum number of crosspoints for any number of inputs… (More)

- A. Yavuz Oruç
- 1994

Permutation switching is a critical element of many computer and communication systems. Within a group theoretical framework, this paper provides an indepth study of permutation networks, and examines the tradeoffs between network cost and set up or routing time. It introduces the notion of an (n, r, q)-permuter, i.e., a permuter with n inputs and r outputs… (More)

- Ching-Yi Lee, A. Yavuz Oruç
- ICPP
- 1992

This paper presents a new generalized connector with a very simple self-routing scheme. Unlike some of the recently reported generalized connectors, this generalized connector does not rely on an explicit use of a copy network; rather it replicates packets as it routes them through its stages to their destinations. In addition to its attractive routing… (More)

- A. Yavuz Oruç, H. M. Huang
- IEEE Trans. Information Theory
- 1996

A sparse crossbar (n,m, c)-concentrator is a bipartite graph with n inputs and m outputs in which any c or fewer inputs can be matched with an equal number of outputs, where c is called its capacity. Sparse crossbar concentrators play a key role in multiplexing signals in communication systems and constructing permutation and generalized connection… (More)

- A. Yavuz Oruç, M. Yaman Oruç
- IEEE Trans. Computers
- 1987

A fundamental problem in interconnection network theory is to design permutation networks with as few cells as possible and a small programming or setup time. The well-known networks of Benes and Waksman have asymptotically optimal cell counts, but the best setup algorithm available for such networks with n inputs requires O(n log2 n) sequential time. As an… (More)

- John D. Carpinelli, A. Yavuz Oruç
- Networks
- 1994

- Minze V. Chien, A. Yavuz Oruç
- IEEE Trans. Communications
- 1994

Concentrators are used to interface and combine together low speed communication channels onto higher speed transmission links to alleviate transmission costs. They are also used to construct more powerful switching fabrics such as permutation and broadcast networks. Using an adaptive binary sorting network model, this paper constructs new concentrators and… (More)

- Minze V. Chien, A. Yavuz Oruç
- ICPP
- 1992

Many routing problems in parallel processing such as concentration and permutation problems can be cast as sorting problems. In this paper we consider the problem of sorting on a new model, called an adaptive sorting network. We show that any sequence of n bits can be sorted on this model in O(lg n) bit-level delay using O(n) constant fanin gates. This… (More)

- A. Yavuz Oruç
- CISS
- 2015