Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Keyword
-
- Parallel processing (Electronic computers) (4)
- Associative storage (2)
- Computer simulation (2)
- VHDL (Computer hardware description language) (2)
- Ada (Computer program language) (1)
-
- Air warfare--Simulation methods (1)
- Associative memory (1)
- Bit-serial word-parallel associative memory (1)
- Combat--Computer simulation (1)
- Computer architecture (1)
- Computer interfaces (1)
- Computer storage devices (1)
- Content-addressable memory (1)
- Demographics. (1)
- Discrete-time systems (1)
- Domain analysis (1)
- Expert systems (Computer science) (1)
- Genetic algorithms (1)
- Hypercube (1)
- Information systems effectiveness (1)
- Integrated circuits--Very large scale integration (1)
- Interactive computer systems (1)
- Knowledge acquisition (1)
- Knowledge base population (1)
- Knowledge-based systems (1)
- Local area network (1)
- Local area networks (Computer networks) (1)
- Machine learning (1)
- Multiprocessors (1)
- Object-oriented databases (1)
Articles 1 - 11 of 11
Full-Text Articles in Computer Engineering
Genetic Algorithms Applied To A Mission Routing Problem, James B. Olsan
Genetic Algorithms Applied To A Mission Routing Problem, James B. Olsan
Theses and Dissertations
This thesis applies genetic algorithms to a mission routing problem. The mission routing problem involves determining an aircraft’s best route between a staging base and a target. The goal is to minimize the route distance and the exposure to radar. Potential routes are mapped to a 3-dimensional mesh where the nodes correspond to checkpoints in the route and the arcs correspond to partial paths of the route. Each arc is weighted with respect to distance and exposure to radar. A genetic algorithm is a probabilistic search technique loosely based on theories of biological evolution. Genetic crossover and survival of the …
Virtual Memory Management And Virtual Bus Overloading On Multiple Channel Architectures, John N. Armitstead
Virtual Memory Management And Virtual Bus Overloading On Multiple Channel Architectures, John N. Armitstead
Theses and Dissertations
Today's computational environment requires the processing capabilities available only through parallel architectures. The bottleneck that limits the potential of parallel processing is communication between processors, memories, and other hardware devices. A proposed multiple channel architecture (MCA) utilizes tunable semiconductor lasers and fiber optic cables that serve as the communication medium between processor, memory, and I/O nodes. A memory management unit (MMU) was completely described and implemented in a multiprocessor simulator. A permutation-based interleaving (PBI) scheme was utilized to reduce the chance of memory access collisions. Virtual bus utilization, number of collisions, and message traffic patterns were studied under various amounts …
Local Area Network Implementation At The 4950th Test Wing: A Study Of The Relationship Between Individual Factors And The Effectiveness Of A Local Area Network, Doyle F. Cone, David J. Donahoo
Local Area Network Implementation At The 4950th Test Wing: A Study Of The Relationship Between Individual Factors And The Effectiveness Of A Local Area Network, Doyle F. Cone, David J. Donahoo
Theses and Dissertations
This research investigated the individual factors which directly impacted the effectiveness of the 4950th Test Wing local area network (LAN). Areas of interest included the relationships between demographic and user attitude factors and LAN effectiveness. A literature review provided the basis for: 1) operationally defining effectiveness as a subjective measure of user satisfaction; 2) identifying specific factors which impact information system effectiveness; and 3) developing a research instrument to measure user attitudes and user satisfaction. A questionnaire was administered to 342 LAN users 173 were returned (a response rate of 51 percent). Sixteen factors (eight demographic factors and eight attitude …
Partitioning Structural Vhdl Circuits For Parallel Execution On Hypercubes, Kevin L. Kapp
Partitioning Structural Vhdl Circuits For Parallel Execution On Hypercubes, Kevin L. Kapp
Theses and Dissertations
Distributing simulations among multiple processors is one approach to reducing VHDL simulation time for large VLSI circuit designs. However, parallel simulation introduces the problem of how to partition the logic gates and system behaviors among the available processors in order to obtain maximum speedup. This research investigates deliberate partitioning algorithms that account for the complex inter-dependency structure of the circuit behaviors. Once an initial partition has been obtained, a border annealing algorithm is used to iteratively improve the partition. In addition, methods of measuring the cost of a partition and relating it to the resulting simulation performance are investigated. Structural …
Interactive Control Of A Parallel Simulation From A Remote Graphics Workstation, Douglas C. Looney
Interactive Control Of A Parallel Simulation From A Remote Graphics Workstation, Douglas C. Looney
Theses and Dissertations
Modern military commanders are faced with an overwhelming amount of intelligence data concerning the disposition of engaging forces, The sheer volume of data produced for a single planning scenario is an obstacle to the user as well as the computer. Today’s commander requires a real-time, three- dimensional representation of the battlefield in order to assimilate the data for the management of a conflict. Parallel computation is required to complete the processing of this information in a timely manner. A network protocol is required to link the interface with the parallel simulation. The of this study is to improve user interaction …
An Object-Oriented Database Interface For Ada, Anthony D. Moyers
An Object-Oriented Database Interface For Ada, Anthony D. Moyers
Theses and Dissertations
Object data management ODM is currently at the forefront of research and development efforts in the database community. In order to take advantage of ODM technology, the Department of Defense DoD needs to ensure that these systems are accessible to Ada programmers. The Air Force Institute of Technology AFIT is conducting research towards the development of an Ada ODM interface to existing ODM systems. The design goals are portability, transparency, and completeness for Ada programmers. Portability means that the ODM system can be changed without affecting any existing application programs. Transparency means that Ada programmers can use the interface without …
A Method For Populating The Knowledge Base Of Aptas, A Domain-Oriented Application Composition System, Raleigh A. Sandy Iii
A Method For Populating The Knowledge Base Of Aptas, A Domain-Oriented Application Composition System, Raleigh A. Sandy Iii
Theses and Dissertations
A formal process is described for populating the knowledge base of the Automatic Programming Technologies for Avionics Software APTAS system. This process was developed using a general knowledge base population process that applies to many knowledge-based software engineering systems. This general process is also described. The formal process for APTAS was demonstrated by storing new information from the radar tracking domain into the knowledge base of APTAS. Several procedures some automatic and some manual were implemented to support the formal process.
Design Of A Parallel Discrete Event Simulation Coprocessor, Jacob L. Berlin
Design Of A Parallel Discrete Event Simulation Coprocessor, Jacob L. Berlin
Theses and Dissertations
A Parallel Discrete Event Simulation Coprocessor was designed to off- load the synchronization overhead from the processors executing the application. In a multiprocessor architecture, one coprocessor executes the synchronization routines for each host processor. Speedup can be achieved when the host processor executes the application and the coprocessor concurrently executes synchronization routines. The coprocessor uses a programmable microcode control store to guarantee flexibility in the synchronization routines. The coprocessor uses an Extreme Search Associative Memory to support fast Next Event Queue NEQ management. This associative memory uses bit-serial word-parallel search logic to provide 01 insert and retrieval time of events …
Using Discovery-Based Learning To Prove The Behavior Of An Autonomous Agent, David N. Mezera
Using Discovery-Based Learning To Prove The Behavior Of An Autonomous Agent, David N. Mezera
Theses and Dissertations
Computer-generated autonomous agents in simulation often behave predictably and unrealistically. These characteristics make them easy to spot and exploit by human participants in the simulation, when we would prefer the behavior of the agent to be indistinguishable from human behavior. An improvement in behavior might be possible by enlarging the library of responses, giving the agent a richer assortment of tactics to employ during a combat scenario. Machine learning offers an exciting alternative to constructing additional responses by hand by instead allowing the system to improve its own performance with experience. This thesis presents NOSTRUM, a discovery-based learning DBL system …
A Decision Criteria To Select An Associative-Memory Organization That Minimizes The Execution Time Of A Mix Of Associative-Search Operations, David W. Banton
A Decision Criteria To Select An Associative-Memory Organization That Minimizes The Execution Time Of A Mix Of Associative-Search Operations, David W. Banton
Theses and Dissertations
The dissertation develops a decision criteria to select an associative-memory organization that minimizes the execution time of a mix of associative-search operations and a decision criteria to estimate the layout dimensions of each organization for a specified memory size. The dissertation reclassifies Feng's associative-search operations into three hardware-influenced categories: bit-position independent (BPI), record-content independent (RCI); bit-position dependent (BPD), RCI; and BPD, record-content dependent (RCD). It develops a relationship between the categories and three associative-memory organizations: the CAM, the bit-serial word-parallel associative memory (BSWPAM) , and the extreme-search associative memory (ESAM). A version of the CAM, three versions of the BSWPAM, …
Design Of A Hardware Discrete Event Simulation Coprocessor, David W. Daniel
Design Of A Hardware Discrete Event Simulation Coprocessor, David W. Daniel
Theses and Dissertations
A hardware discrete event simulation (DES) coprocessor was designed to eliminate synchronization overhead as a possible bottleneck. The target architecture is an eight node Intel iPSC/2 Hypercube, but this design has application to future CPU designs that wish to incorporate on-chip architectural features to better support parallel processor synchronization. A structural description of a general-purpose DES hardware coprocessor is given with approximately 90 percent of the components written at the gate level. The remaining components use low-level behavioral descriptions. While the DES coprocessor microcode implements the Chandy-Misra protocol, general-purpose support for a wide-range of protocols was a primary hardware design …