The Bilkent University Open Access Articles collection consists of scholarly articles written by Bilkent-affiliated authors that are made available through BUIR under the Bilkent Faculty Open Access Policy, or under related publisher agreements.
Version details are supplied for each paper in the collection:
Original manuscript: author's manuscript prior to formal peer review
Author's final manuscript: final author's manuscript post peer review, without publisher's formatting or copy editing
Final published version: final published article, as it appeared in a journal, conference proceedings, or other formally published context (this version appears here only if allowable under publisher's policy)
Post peer-reviewed scholarly articles are available through BUIR collections, such as those for departments, labs, and research centers.
Browsing Scholarly Publications by Author "Abali, B."
We describe the adaptive source routing (ASR) method which is a first attempt to combine adaptive routing and source routing methods. In ASR, the adaptivity of each packet is determined at the source processor. Every packet can be routed in a fully adaptive or partially adaptive or non-adaptive manner, all within the same network at the same time. We evaluate and compare performance of the proposed adaptive source routing networks and oblivious routing networks by simulations. We also describe a route generation algorithm that determines maximally adaptive routes in multistage networks.
A parallel sorting algorithm for sorting n elements
evenly distributed over Zd = p nodes of a d-dimensional hypercube
is presented. The average running time of the algorithm
is O( (n log n)/p + p log2 n). The algorithm maintains a perfect
load balance in the nodes by determining the (kn/p)th elements
(k = 1,. . . , (p - 1)) of the final sorted list in advance. These
p - 1 keys are used to partition the sorted sublists in each node
to redistribute data to the nodes to be merged in parallel. The
nodes finish the sort with an equal number of elements (n/p)
regardless of the data distribution. A parallel selection algorithm
for determining the balanced partition keys in O(p log2 n) time
is presented. The speed of the sorting algorithm is further enhanced
by the distanced communication capability of the iPSC/2
hypercube computer and a novel conflict-free routing algorithm.
Experimental results on a 16-node hypercube computer show
that the new sorting algorithm is competitive with the previous
algorithms, and faster for skewed data distributions.