Back to search
CSUniversity San Bernardino - Retro
A heuristic on the rearrangeability of shuffle-exchange networks
Abstract
dc:description.abstractThe 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 × 8Identifiers
dc:identifier.*- Repository record dc:identifier
- https://scholarworks.lib.csusb.edu/etd-project/2521