Computer Engineering Commons^™

Genetic Algorithms Vs. Simulated Annealing: A Comparison Of Approaches For Solving The Circuit Partitioning Problem, Theodore W. Manikas, James T. Cain

Computer Science and Engineering Research

An important stage in circuit design is placement, where components are assigned to physical locations on a chip. A popular contemporary approach for placement is the use of simulated annealing. While this approach has been shown to produce good placement solutions, recent work in genetic algorithms has produced promising results. The purpose of this study is to determine which approach will result in better placement solutions.

A simplified model of the placement problem, circuit partitioning, was tested on three circuits with both a genetic algorithm and a simulated annealing algorithm. When compared with simulated annealing, the genetic algorithm was found …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 5, May 1996, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

An eight page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 4, April 1996, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A six page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Ua3/8/5 Application For Cause Award For Excellence In Campus Networking, Wku President's Office-Meredith

WKU Archives Records

Application for CAUSE award for excellence in campus networking gives details about the first WKU computer network.

Development Of A Security Network (Secnet) Based On Integrated Services Digital Network (Isdn), Isidro Alvarez

FIU Electronic Theses and Dissertations

The progress in the computing and communication industries together with the fast evolution of the semiconductor industry has made possible advances in the communications field. These advances have been used by other related applications to improve the services that they bring about. On the other hand, business crimes have increased three digits orders of magnitude in one decade, making from 20% to 30% of small businesses fail. These conditions demand new solutions to make security systems more reliable and efficient.

The present work combines ISDN as a network with a security system to create a security network (SECNET). It will …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 3, March 1996, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 2, February 1996, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A fourteen page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

An Architecture Of Component - Based Capp Systems For Agile Manufacturing, Chun Zhang, Shaw Feng, Steven Ray

Steven R Ray

The current manufacturing planning software systems (such as computer aided process planning (CAPP) systems) are general and in a closed form, i.e., it is very difficult to modify these systems to respond to a user's dynamically changing needs. These systems are no longer suitable for agile manufacturing. This research work aims at developing an architecture for rapid development of CAPP systems. The architecture supports the construction of CAPP systems from prepackaged, plug-compatible software components. The specifications of the architecture and its building blocks are defined. A prototype system is under development to prove the concept.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 1, January 1996, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A twelve page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

An Application Of Plausible Reasoning To Information Retrieval, Farhad Oroumchian, Robert N. Oddy

Robert Oddy

This work explores the use of plausible inferences as a means of retrieving relevant documents. Collins and Michalski’s theory of plausible reasoning has been modified to accommodate information retrieval. Methods are proposed to represent document contents by logical terms and statements, and queries by incomplete logical statements. Extensions to plausible inferences are discussed. Two versions of the extended plausible reasoning system were implemented, one using dominance weights (described in the paper) and the other using tf. Idf (Term Frequency Inverse Document Frequency) weights. Experiments were conducted using the titles and abstracts of the CACM collection and it was found that …

Software Quality: Definitions And Strategic Issues, Ronan Fitzpatrick

Reports

This paper contains two sections relating to software quality issues. First, the various definitions of software quality are examined and an alternative suggested. It continues with a review of the quality model as defined by McCall, Richards and Walters in 1977 and mentions the later model of Boëhm published in 1978. Each of McCall's quality factors is reviewed and the extent to which they still apply in the late 1990s is commented on. The factors include, integrity, reliability, usability, accuracy, efficiency, maintainability, testability, flexibility,interface facility (interoperability), re-usability and transferability (portability). They are subdivided into external and internal quality factors. Interrelationships …

Efficient User Space Protocol Implementations With Qos Guarantees Using Real-Time Upcalls, R. Gopalakrishnan, Guru M. Parulkar

All Computer Science and Engineering Research

Real-time upcalls (RTUs) are an operating systems mechanism to provide quality-of-service (QoS) guarantees to network applications, and to efficiently implement protocols in user space with (QoS) guarantees. Traditionally, threads (and real-time extensions to threads) have been used to structure concurrent activities in user space protocol implementations. However, preemptive scheduling required for real-time threads leads to excessive context switching, and introduces the need for expensive concurrency control mechanisms such as locking. The RTU mechanism exploits the iterative nature of protocol processing to eliminate the need for locking, and reduce asynchronous preemption, while ensuring real-time operation. In addition to efficiency, eliminating the …

Incorporating Matlab's Signal Processing Toolbox Into A Dsp Course At An Undergraduate E.E. Program, Sol Neeman Ph.D.

Engineering Studies Faculty Publications and Creative Works

This paper provides some suggestions for incorporating MATLAB's Signal Processing Toolbox into a DSP course. Often, in a DSP course, students have difficulties understanding abstract and non-intuitive concepts and seeing their relevance to the practical part of their curriculum. The tools offered by MATLAB's Signal Processing Toolbox, can help to make these concepts more tangible and provide a perspective for students. Some basic tools relevant to an undergraduate DSP course will be introduced, including examples of tool use and graphic results. The tools presented will be applied in the areas of synthesis and analysis of signals, FFT computation, impulse response …

Collaborative Scientific Data Visualization, Byeongseob Ki, Scott Klasky

Northeast Parallel Architecture Center

We have designed a collaborative scientific visualization package that will aid researchers from distant, diverse locations to work together in developing scientific codes, providing them with a system to analyze their scientific data. We have utilized Java to develop this infrastructure. Two important areas which we have concentrated on developing are 1) a collaborative framework from which the scientific data is interpreted and utilized, and 2) a framework, which is customizable to the suit the needs of a particular task and/or scientific group.

Compile-Time Performance Prediction Of Hpf/Fortran 90d, Manish Parashar, Salim Hariri

Electrical Engineering and Computer Science - All Scholarship

In this paper we present an interpretive approach for accurate and cost-effective performance prediction in a high performance computing environment, and describe the design of a compile-time HPF/Fortran 90D performance prediction framework based on this approach. The performance prediction framework has been implemented as a part of the HPF/Fortran 90D application development environment that integrates it with a HPF/Fortran 90D compiler and a functional interpreter. The current implementation of the environment framework is targeted to the iPSC/860 hypercube multicomputer system. A set of benchmarking kernels and application codes have been used to validate the accuracy, utility, and usability of the …

A Framework For Integrated Communication And I/O Placement, Rajesh Bordawekar, Alok Choudhary, J Ramanujam

Electrical Engineering and Computer Science - All Scholarship

This paper describes a framework for analyzing dataflow within an out-of-core parallel program. Dataflow properties of FORALL statement are analyzed and a unified I/O and communication placement framework is presented. This placement framework can be applied to many problems, which include eliminating redundant I/O incurred in communication. The framework is validated by applying it for optimizing I/O and communication in out-of-core stencil problems. Experimental performance results on an Intel Paragon show significant reduction in I/O and communication overhead.

A Framework For Integrated Communication And I/O Placement, Rajesh Bordawekar, Alok Choudhary, J Ramanujam

Electrical Engineering and Computer Science - All Scholarship

This paper describes a framework for analyzing dataflow within an out-of-core parallel program. Dataflow properties of FORALL statement are analyzed and a unified I/O and communication placement framework is presented. This placement framework can be applied to many problems, which include eliminating redundant I/O incurred in communication. The framework is validated by applying it for optimizing I/O and communication in out-of-core stencil problems. Experimental performance results on an Intel Paragon show significant reduction in I/O and communication overhead.

Design Of A Gigabit Atm Switch, Tom Chaney, Andrew Fingerhut, Margaret Flucke, Jonathan S. Turner

All Computer Science and Engineering Research

This report describes the design and implementation of a gigabit ATM switching system supporting link rates from 150 Mb/s to 2.4 Gb/s, with a uniquely efficient multicast switch architecture that enables the construction of systems with essentially constant per port costs for configurations ranging from 8 to 4096 ports and system capacities approaching 1- Tb.s. The system design supports many-to-one and many-to-many forms of multicast, in addition to the usual one-to-many. It also provides multicast virtual paths, constant time configuration of multicast connections and an efficient packet-level discard method, that can achieve 100% link efficiencies, without large buffers.

Reconsidering Fragmentation And Reassembly, Girish P. Chandranmenon, George Varghese

All Computer Science and Engineering Research

We reconsider several issues related to fragmentation and reassembly in IP. We first reconsider reassembly. We describe a simple expected case optimization that improves reassembly performance to 38 instructions per fragment if the fragments arrive in FIFO order (the same assumption made in header prediction) which has been implemented in the NetBSD kernel. Next, we introduce the new idea of Graceful Intermediate Reassembly (GIR), which is a generalization of the existing IP mechanisms of destination and hop-by-hop reassembly. In GIR, we coalesce the fragments at an intermediate router in order to use the largest sized packets on its outgoing interface. …

Optimal Solution Of Off-Line And On-Line Generalized Caching, Saied Hosseini-Khayat, Jerome R. Cox

All Computer Science and Engineering Research

Network traffic can be reduced significantly if caching is utilized effectively. As an effort in this direction we study the replacement problem that arises in caching of multimedia objects. The size of objects and the cost of cache misses are assumed non-uniform. The non-uniformity of size is inherent in multimedia objects, and the non-uniformity of cost is due to the non-uniformity of size and the fact that the objects are scattered throughout the network. Although a special case of this problem, i.e. the case of uniform size and cost, has been extensively studied, the general case needs a great deal …

End-User Construction And Configuration Of Distributed Multimedia Applications, Terrance Paul Mccartney

All Computer Science and Engineering Research

Distributed multimedia applications supported by a global electronic infrastructure have tremendous potential for providing users with customized communication and computation environments. Since communication and computation requirements vary by context and change dynamically, it is unlikely that off-the-shelf applications will anticipate the needs of all users. Therefore, empowering end-users to create their own customized applications for both communication and computation is an important challenge. This dissertation presents several mechanisms that enable end-users to create and configure distributed multimedia applications, including end-users construction direct manipulation graphical users interface (GUIs) and application management of distributed multimedia applications over the Internet.

An Optimistic Concurrency Control Mechanism Based On Clock Synchronization, Myoung Jin Park

Theses Digitization Project

No abstract provided.

Power Spectra Of Signal Formats For Ds-Ss Cdma Wireless Lans, Beata J. Wysocki, Tadeusz Wysocki

Department of Electrical and Computer Engineering: Faculty Publications (to 2015)

The paper deals with the spectral analysis of signal formats for DS-SS CDMA WLANs. The main emphasis is put on introduction of a quantitative measure which allows for comparison of different spreading codes and channel modulations from the viewpoint of a uniformity of an in-hand power distribution Such a measure is essential to compare different DS-SS CDMA systems performance in mitigating the effects of frequency selective fading.

Design Of Nonblocking Atm Networks, J. Andrew Fingerhut, Rob Jackson, Subhash Suri, Jonathan S. Turner

All Computer Science and Engineering Research

This paper considers the problem of designing ATM networks that are nonblocking with respect to virtual circuit requests, subject to specified constraints on the traffic. In this paper, we focus on global traffic constraints that simply limit the total entering and exiting traffic at each switching system. After reviewing prior results for linear link costs, we introduce a more realistic link cost model, and develop a number of results using it. We also describe a technique for converting tree-structured networks to nonblocking hierarchical networks satisfying limits on the capacity of any single switch.

Designing Minimum Cost Nonblocking Communication Networks, J. Andrew Fingerhut, Subhash Suri, Jonathan S. Turner

All Computer Science and Engineering Research

This paper addresses the problem of topological design of ATM (and similar) communication networks. We formulate the problem from a worst-case point of view, seeking network desings that, subject to specified traffic constraints, are nonblocking for point-to-point and multicast virtual circuits. Within this model we give various conditions under which star networks are optimal or near-optimal. These conditions are approximately satisfied in many common situations making the results of practical significance. An important consequence of these results is that, where they apply, there is no added cost for nonblocking multicast communication, relative to networks that are nonblocking for point-to-point traffic …

Leap Forward Virtual Clock: An O(Loglogn) Fair Queuing Scheme With Guaranteed Delays And Throughput Fairness, Subhash Suri, George Varghese, Girish P. Chandranmenon

All Computer Science and Engineering Research

We describe an efficient fair queuing scheme, Leap Forward Virtual Clock, that provides end-to-end delay bounds almost identical to that of PGPS fair queuing, along with throughput fairness. Our scheme can be implemented with a worst-case time O(loglogN) per packet guaranteed delay and throughput fairness. As its name suggests, our scheme is based on Zhang's virtual clock. While the original virtual clock scheme does not achieve throughput fairness, we can modify it with a simple leap forward mechanism that keeps the server clock from lagging too far behind the packet tags. We prove that our scheme guarantees a fair share …

Vaudeville: A High Performance, Voice-Activated Teleconferencing Application, Jyoti K. Parwatikar, T. Paul Mccartney, John D. Dehart, Maynard Engebretson, Kenneth J. Goldman

All Computer Science and Engineering Research

We present a voice-activated, hands-off, ATM-based video conferencing application. The application, called Vaudeville, features high quality NTSC video, voice-activated audio transmission, audio bridging of two audio streams, and voice-activated video switching. It supports multiple simultaneous multi-party conferences using a scalable multicast mechanism. We describe how Vaudeville was built using a component-based distributed programming environment. We also describe the algorithms used to contorl the audio and video of the applciation. Audio and video are encoded in hardware using an ATM hardware multimedia interface.

Design And Implementation Of A Practical Security-Conscious Electronic Polling System, Lorrie Faith Cranor, Ron K. Cytron

All Computer Science and Engineering Research

We present the design and implementation of Sensus, a practical, secure and private system for conducting surveys and elections over computer networks. Expanding on the work of Fujioka, Okamoto, and Ohta, Sensus uses blind signatures to ensure that only registered voters can vote and that each registered voter only votes once, while at the same time maintaining voters' privacy. Sensus allows voters to verify independently that their votes were counted correctly, and anonymously challenge the results should their votes be miscounted. We outline seven desirable properties of voting systems and show that Sensus satisfied these properties well, in some cases …

New Results On Generalized Caching, Saied Hosseini-Khayat

All Computer Science and Engineering Research

We report a number of new results in generalized caching. This problem arises in modern computer networks in which data objects of various sizes are transmitted frequently. First it is shown that its optimal solution is NP-complete. Then we explore two methods of obtaining nearly optimal answers based on the dynamic programming algorithm that we provided in [5]. These methods enable a trade-off between optimality and speed. It is also shown that LFD (the longest forward distance algorithm which is the optimal policy in the classical case), is no longer optimal but is competitive. We also prove that LRU remains …

Bringing Real-Time Scheduling Theory And Practice Closer For Multimedia Computing, R. Gopalakrishnan, Guru M. Parulkar

All Computer Science and Engineering Research

This paper seeks to bridge the gap between theory and practice of real-time scheduling in the domain of multimedia computer systems. We show that scheduling algorithms that are good in theory, often have practical limitations. However when these algorithms are modified based on practical considerations, existing theoretical results cannot be used as they are. In this paper we motivate the need for new scheduling schemes for multimedia protocol processing, and demonstrate their real-time performance in our prototype implementation. We then explain the observed results by analysis and measurement. More specifically, we show that using strict preemption can introduce overheads in …