Back to search

CSUniversity San Bernardino

A heuristic on the rearrangeability of shuffle-exchange networks

Abstract

dc:description.abstract

The algorithms which control network routing are specific to the network because the algorithms are designed to take advantage of that network's topology. The "goodness" of a network includes such criteria as a simple routing algorithm and a simple routing algorithm would increase the use of the shuffle-exchange network.

Degree

thesis:*
Name thesis:degree_name
Master of Science in Computer Science
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
School of Computer Science and Engineering

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Alston, Katherine Yvette

Subjects

dc:subject × 8

Identifiers

dc:identifier.*
Repository record dc:identifier
https://scholarworks.lib.csusb.edu/etd-project/2521

Chain of custody

source
Harvested from
CSUniversity San Bernardino
Base URL
scholarworks.lib.csusb.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Alston, Katherine Yvette. A heuristic on the rearrangeability of shuffle-exchange networks. Thesis thesis, https://scholarworks.lib.csusb.edu/etd-project/2521