Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Old Dominion University (21)
- Singapore Management University (15)
- University of Nebraska - Lincoln (10)
- University of Arkansas, Fayetteville (9)
- SelectedWorks (7)
-
- Florida International University (6)
- Selected Works (6)
- Air Force Institute of Technology (5)
- Embry-Riddle Aeronautical University (5)
- Western University (5)
- California Polytechnic State University, San Luis Obispo (4)
- California State University, San Bernardino (4)
- Loyola University Chicago (4)
- Portland State University (4)
- University of Nevada, Las Vegas (4)
- Georgia Southern University (3)
- Purdue University (3)
- University of New Mexico (3)
- City University of New York (CUNY) (2)
- Michigan Technological University (2)
- Olivet Nazarene University (2)
- Southern Methodist University (2)
- Technological University Dublin (2)
- University of Denver (2)
- University of Kentucky (2)
- University of Louisville (2)
- University of Massachusetts Amherst (2)
- University of New Orleans (2)
- Western Kentucky University (2)
- Belmont University (1)
- Keyword
-
- Algorithms (8)
- Security (6)
- Robotics (5)
- Algorithm (4)
- Computer algorithms (4)
-
- Image processing (4)
- Machine Learning (4)
- Machine learning (4)
- Small Spacecraft (4)
- Adaptive algorithms (3)
- Artificial Intelligence & Robotic Control (3)
- Cloud Computing (3)
- Coverage control problems (3)
- Cryptography (3)
- CubeSat (3)
- Dynamic vehicle routing problems (3)
- Encryption (3)
- FPGA (3)
- Graph (3)
- Heterogeneous computing (3)
- Image Processing (3)
- Interconnection network (3)
- Internet of Things (3)
- Latency (3)
- Localization (3)
- Open Orbiter Project (3)
- Partitioning algorithms (3)
- Queueing theory (3)
- Simulation (3)
- Stochastic gradient algorithms (3)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (15)
- Computer Science Theses & Dissertations (7)
- Electronic Theses and Dissertations (6)
- FIU Electronic Theses and Dissertations (6)
- Jeremy Straub (6)
-
- Theses and Dissertations (6)
- Department of Computer Science and Engineering: Dissertations, Theses, and Student Research (5)
- Electronic Thesis and Dissertation Repository (5)
- Computer Science Faculty Publications (4)
- Computer Science and Computer Engineering Undergraduate Honors Theses (4)
- Computer Science: Faculty Publications and Other Works (4)
- Computer Science Faculty Publications and Presentations (3)
- George J. Pappas (3)
- Graduate Theses and Dissertations (3)
- Journal of International Technology and Information Management (3)
- Publications (3)
- CSE Technical Reports (2)
- Computer Engineering (2)
- Conference papers (2)
- Dissertations, Master's Theses and Master's Reports (2)
- Doctoral Dissertations (2)
- Doctoral Dissertations and Master's Theses (2)
- Electrical & Computer Engineering Faculty Publications (2)
- Electrical & Computer Engineering Faculty Research (2)
- Electrical & Computer Engineering Theses & Dissertations (2)
- Faculty Publications (2)
- Master's Theses (2)
- Masters Theses & Specialist Projects (2)
- Modeling, Simulation and Visualization Student Capstone Conference (2)
- Ronald Greenberg (2)
Articles 151 - 160 of 160
Full-Text Articles in Computer Engineering
Modeling And Comparison Of Wormhole Routed Mesh And Torus Networks, Ronald I. Greenberg, Lee Guan
Modeling And Comparison Of Wormhole Routed Mesh And Torus Networks, Ronald I. Greenberg, Lee Guan
Computer Science: Faculty Publications and Other Works
2D-mesh and torus networks have often been proposed as the interconnection pattern for parallel computers. In addition, wormhole routing has increasingly been advocated as a method of reducing latency. Most analysis of wormhole routed networks, however, has focused on the torus and the broader class of k-ary n-cubes to which it belongs. This paper presents a performance model for the wormhole routed mesh, and it compares the performance of the mesh and torus based on theoretical and empirical analyses.
An Improved Analytical Model For Wormhole Routed Networks With Application To Butterfly Fat-Trees, Ronald I. Greenberg, Lee Guan
An Improved Analytical Model For Wormhole Routed Networks With Application To Butterfly Fat-Trees, Ronald I. Greenberg, Lee Guan
Computer Science: Faculty Publications and Other Works
A performance model for wormhole routed interconnection networks is presented and applied to the butterfly fat-tree network. Experimental results agree very closely over a wide range of load rate. Novel aspects of the model, leading to accurate and simple performance predictions, include (1) use of multiple-server queues, and (2) a general method of correcting queuing results based on Poisson arrivals to apply to wormhole routing. These ideas can also be applied to other networks.
Dynamic Load Distribution In Mist, K. Al-Saqabi, R. M. Prouty, Dylan Mcnamee, Steve Otto, Jonathan Walpole
Dynamic Load Distribution In Mist, K. Al-Saqabi, R. M. Prouty, Dylan Mcnamee, Steve Otto, Jonathan Walpole
Computer Science Faculty Publications and Presentations
This paper presents an algorithm for scheduling parallel applications in large-scale, multiuser, heterogeneous distributed systems. The approach is primarily targeted at systems that harvest idle cycles in general-purpose workstation networks, but is also applicable to clustered computer systems and massively parallel processors. The algorithm handles unequal processor capacities, multiple architecture types and dynamic variations in the number of processes and available processors. Scheduling decisions are driven by the desire to minimize turnaround time while maintaining fairness among competing applications. For efficiency, the virtual processors (VPs) of each application are gang scheduled on some subset of the available physical processors.
Single Row Routing: Theoretical And Experimental Performance Evaluation, And New Heuristic Development, David A. Hysom
Single Row Routing: Theoretical And Experimental Performance Evaluation, And New Heuristic Development, David A. Hysom
Computer Science Theses & Dissertations
The Single Row Routing Problem (SRRP) is an abstraction arising from real-world multilayer routing concerns. While NP-Complete, development of efficient SRRP routing heuristics are of vital concern to VLSI design. Previously, researchers have introduced various heuristics for SRRP; however, a comprehensive examination of SRRP behavior has been lacking.
We are particularly concerned with the street-congestion minimization constraint, which is agreed to be the constraint of greatest interest to industry. Several theorems stating lower bounds on street congestion are known. We show that these bounds are not tight in general, and argue they may be in error by at least 50% …
Simulator For The Performance Analysis Of Cpm Schemes In An Indoor Wireless Environment, Ronald Chua
Simulator For The Performance Analysis Of Cpm Schemes In An Indoor Wireless Environment, Ronald Chua
Theses : Honours
A software simulator for characterising Continuous Phase Modulation (CPM) schemes in an indoor multipath environment has been developed using SIMULINK and MATLAB. The simulator is capable of simulating a wide range of CPM schemes to determine bandwidth efficiency and robustness to additive white Gaussian noise (AWGN) and Rician fading. Initial trials of the simulator indicate that the simulator is functioning correctly. Eventually, the simulator will be used to determine the most suitable modulation scheme for the development of an actual indoor wireless system.
Book Review: Reasoning Agents In A Dynamic World: The Frame Problem. Kenneth M. Ford And Patrick J. Hayes, Eds.,, Jozsef A. Toth
Book Review: Reasoning Agents In A Dynamic World: The Frame Problem. Kenneth M. Ford And Patrick J. Hayes, Eds.,, Jozsef A. Toth
Jozsef A Toth Ph.D.
No abstract provided.
Generalization And Parallelization Of Messy Genetic Algorithms And Communication In Parallel Genetic Algorithms., Laurence D. Merkle
Generalization And Parallelization Of Messy Genetic Algorithms And Communication In Parallel Genetic Algorithms., Laurence D. Merkle
Theses and Dissertations
Genetic algorithms (GA) are highly parallelizable, robust semi- optimization algorithms of polynomial complexity. The most commonly implemented GAs are 'simple' GAs (SGAs). Reproduction, crossover, and mutation operate on solution populations. Deceptive and GA-hard problems are provably difficult for simple GAs. Messy GAs (MGA) are designed to overcome these limitations. The MGA is generalized to solve permutation type optimization problems. Its performance is compared to another MGA's, an SGA's, and a permutation SGA's. Against a fully deceptive problem the generalized MGA (GMGA) consistently performs better than the simple GA. Against an NP-complete permutation problem, the GMGA performs better than the other …
Packet Routing In Networks With Long Wires, Ronald I. Greenberg, H.-C. Oh
Packet Routing In Networks With Long Wires, Ronald I. Greenberg, H.-C. Oh
Computer Science: Faculty Publications and Other Works
In this paper, we examine the packet routing problem for networks with wires of differing length. We consider this problem in a network independent context, in which routing time is expressed in terms of “congestion” and “dilation” measures for a set of packet paths. We give, for any constant ε > 0, a randomized on-line algorithm for routing any set of N packets in O((Clg^ε(Nd)+Dlg(Nd))/lglg(Nd)) time, where C is the maximum congestion and D is the length of the longest path, both taking wire delays into account, and d is the longest path in terms of number of wires. We also …
Pipelining Data Compression Algorithms, R. L. Bailey, R. Mukkamala
Pipelining Data Compression Algorithms, R. L. Bailey, R. Mukkamala
Computer Science Faculty Publications
Many different data compression techniques currently exist. Each has its own advantages and disadvantages. Combining (pipelining) multiple data compression techniques could achieve better compression rates than is possible with either technique individually. This paper proposes a pipelining technique and investigates the characteristics of two example pipelining algorithms. Their performance is compared with other well-known compression techniques.
Randomized Routing On Fat-Trees, Ronald I. Greenberg
Randomized Routing On Fat-Trees, Ronald I. Greenberg
Computer Science: Faculty Publications and Other Works
Fat-trees are a class of routing networks for hardware-efficient parallel computation. This paper presents a randomized algorithm for routing messages on a fat-tree. The quality of the algorithm is measured in terms of the load factor of a set of messages to be routed, which is a lower bound on the time required to deliver the messages. We show that if a set of messages has load factor lambda on a fat-tree with n processors, the number of delivery cycles (routing attempts) that the algorithm requires is O(lambda+lgnlglgn) with probability 1-O(1/ …