Digital Commons Network^™

A Geometric Approach To Molecular Docking And Similarity, Chandrajit Bajaj, Fausto Bernardini, Kokichi Sugihara

Department of Computer Science Technical Reports

No abstract provided.

Automating Output Size And Reuse Metrics In A Repository-Based Computer-Aided Software Engineering (Case) Environment, R. D. Banker, Robert J. Kauffman, C. Wright, D. Zweig

Research Collection School Of Computing and Information Systems

Measurement of software development productivity is needed in order to control software costs, but it is discouragingly labor-intensive and expensive. Computer-aided software engineering (CASE) technologies-especially repository-based, integrated CASE-have the potential to support the automation of this measurement. We discuss the conceptual basis for the development of automated analyzers for function point and software reuse measurement for object-based CASE. Both analyzers take advantage of the existence of a representation of the application system that is stored within an object repository, and that contains the necessary information about the application system. We also discuss metrics for software reuse measurement, including reuse leverage, …

Implementation Of An Automatic Mapping Tool For Massively Parallel Computing, Ajitha Gadangi

Theses

In this thesis, an implementation of a generic technique for fine grain mapping of portable parallel algorithms onto multiprocessor architectures is presented. The implemented mapping algorithm is a component of Cluster-M. Cluster-M is a novel parallel programming tool which facilitates the design and mapping of portable softwares onto various parallel systems. The other components of Cluster-M are the Specifications and the Representations. Using the Specifications, machine independent parallel algorithms are presented in a "clustered" fashion specifying the concurrent computations and communications at every step of the overall execution. The Representations, on the other hand, are a form of clustering the …

Concurrent Use Of Two Programming Tools For Heterogeneous Supercomputers, Javier G. Vasquez

Theses

In this thesis, a demostration of the heterogeneous use of two programming paradigms for heterogeneous computing called Cluster-M and HAsC is presented. Both paradigms can efficiently support heterogeneous networks by preserving a level of abstraction which does not include any architecture mapping details. Furthermore, they are both machine independent and hence are scalable. Unlike, almost all existing heterogeneous orchestration tools which are MIMD based, HAsC is based on the fundamental concepts of SIMD associative computing. HAsC models a heterogeneous network as a coarse grained associative computer and is designed to optimize the execution of problems with large ratios of computations …

A Data Parallel Algorithm For Solving The Region Growing Problem On The Connection Machine, Nawal Copty, Sanjay Ranka, Geoffrey C. Fox, Ravi V. Shankar

College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects

Region growing is a general technique for image segmentation, where image characteristics are used to group adjacent pixels together to form regions. This paper presents a parallel algorithm for solving the region growing problem based on the split and merge approach, and uses it to test and compare various parallel architectures and programming models. The implementations were done on the Connection Machine, models CM-2 and CM-5, in the data parallel and message passing programming models. Randomization was introduced in breaking ties during merging to increase the degree of parallelism, and only one and two-dimensional arrays of data were used in …

Parallel Incremental Graph Partitioning Using Linear Programming, Chao Wei Ou, Sanjay Ranka

College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects

Partitioning graphs into equally large groups of nodes while minimizing the number of edges between different groups is an extremely important problem in parallel computing. For instance, efficiently parallelizing several scientific and engineering applications requires the partitioning of data or tasks among processors such that the computational load on each node is roughly the same, while communication is minimized. Obtaining exact solutions is computationally intractable, since graph-partitioning is an NP-complete. For a large class of irregular and adaptive data parallel applications (such as adaptive meshes), the computational structure changes from one phase to another in an incremental fashion. In incremental …

Optimal Processor Assignment For A Class Of Pipelined Computations, Alok N. Choudhary, Bhagirath Narahari, David Nicol, Rahul Simha

Electrical Engineering and Computer Science - All Scholarship

The availability of large scale multitasked parallel architectures introduces the following processor assignment problem: we are given a long sequence of data sets, each of which is to undergo processing by a collection of tasks whose inter-task data dependencies form a series-parallel partial order. Each individual task is potentially parallelizable, with a known experimentally determined execution signature. Recognizing that data sets can be pipelined through the task structure, the problem is to find a "good" assignment of processors to tasks. Two objectives interest us: minimal response time per data set given a throughput requirement, and maximal throughput given a response …

The Binational English & Spanish Telecommunications Network, Armando A. Arias Jr.

SSGS Faculty Publications and Presentations

BESTNET was established in the early 1980's, as an effort to link universities on both sides of the U.S.- Mexico border through microwave, satellite and cable television technologies. In the late 1980's BESTNET focused primarily on the development of asynchronous computer mediated learning and teaching in an internationally networked virtual environment. For the past six years (1990's) BESTNET has strengthened its binational ties and continued its "high tech" focus through the development of active or vibrant model technology which is assisting in the creation of an on-line binational university setting that is "borderless" (albeit, seamless to the user). Today, this …

Performance Modeling Of Load Balancing Algorithms Using Neural Networks, Ishfaq Ahmad, Arif Ghafoor, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka

College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects

This paper presents a new approach that uses neural networks to predict the performance of a number of dynamic decentralized load balancing strategies. A distributed multicomputer system using any distributed load balancing strategy is represented by a unified analytical queuing model. A large simulation data set is used to train a neural network using the back–propagation learning algorithm based on gradient descent. The performance model using the predicted data from the neural network produces the average response time of various load balancing algorithms under various system parameters. The validation and comparison with simulation data show that the neural network is …

Scheduling Of Unstructured Communication On The Intel Ipsc/860, Jhy-Chun Wang, Sanjay Ranka

College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects

In this paper we present several algorithms for decomposing all-to-many personalized communication into a set of disjoint partial permutations. These partial permutations avoid node contention as well as link contention. We discuss the theoretical complexity of these algorithms and study their effectiveness both from the view of static scheduling and from runtime scheduling. Experimental results for our algorithms are presented on the iPSC/860.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 1, January 1994, 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.

Linear Codes And Error-Correction, Karen Brown

Presidential Scholars Theses (1990 – 2006)

The process of encoding information for transmission from one source to another is a vital process in many areas of science and technology. Whenever coded information is sent, there arises a certain possibility that an error will occur, either during transmission or in decoding. Therefore, it is imperative to develop methods to detect and correct errors in a code. The study of coding theory is a "new" area of mathematics which is relatively undeveloped.

This paper focuses on the properties of linear codes -and their corresponding methods of error-correction. To simplify the issue, only binary block codes are studied; hence …

Electronic Document Distribution: Design Of The Anonymous Ftp Langley Technical Report Server, Michael L. Nelson, Gretchen L. Gottlich

Computer Science Faculty Publications

An experimental electronic dissemination project, the Langley Technical Report Server (LTRS), has been undertaken to determine the feasibility of delivering Langley technical reports directly to the desktops of researchers worldwide. During the first six months, over 4700 accesses occurred and over 2400 technical reports were distributed. This usage indicates the high level of interest that researchers have in performing literature searches and retrieving technical reports at their desktops. The initial system was developed with existing resources and technology. The reports are stored as files on an inexpensive UNIX workstation and are accessible over the Internet. This project will serve as …

World Wide Web Implementation Of The Langley Technical Report Server, Michael L. Nelson, Gretchen L. Gottlich, David J. Bianco

Computer Science Faculty Publications

On January 14, 1993, NASA Langley Research Center (LaRC) made approximately 130 formal, 'unclassified, unlimited' technical reports available via the anonymous FTP Langley Technical Report Server (LTRS). LaRC was the first organization to provide a significant number of aerospace technical reports for open electronic dissemination. LTRS has been successful in its first 18 months of operation, with over 11,000 reports distributed and has helped lay the foundation for electronic document distribution for NASA. The availability of World Wide Web (WWW) technology has revolutionized the Internet-based information community. This paper describes the transition of LTRS from a centralized FTP site to …

A Strategy For Electronic Dissemination Of Nasa Langley Technical Publications, Donna G. Roper, Mary K. Mccaskill, Scott D. Holland, Joanne L. Walsh, Michael L. Nelson, Susan L. Adkins, Manjula Y. Ambur, Bryan A. Campbell

Computer Science Faculty Publications

To demonstrate NASA Langley Research Center's relevance and to transfer technology to external customers in a timely and efficient manner, Langley has formed a working group to study and recommend a course of action for the electronic dissemination of technical reports (EDTR). The working group identified electronic report requirements (e.g., accessibility, file format, search requirements) of customers in U.S. industry through numerous site visits and personal contacts. Internal surveys were also used to determine commonalities in document preparation methods. From these surveys, a set of requirements for an electronic dissemination system was developed. Two candidate systems were identified and evaluated …

A Greedy Hypercube-Labeling Algorithm, D. Bhagavathi, C. E. Grosch, S. Olariu

Computer Science Faculty Publications

Due to its attractive topological properties, the hypercube multiprocessor has emerged as one of the architectures of choice when it comes to implementing a large number of computational problems. In many such applications, Gray-code labelings of the hypercube are a crucial prerequisite for obtaining efficient algorithms. We propose a greedy algorithm that, given an n-dimensional hypercube H with N=2² nodes, returns a Gray-code labeling of H, that is, a labeling of the nodes with binary strings of length n such that two nodes are neighbors in the hypercube if, and only if, their labels differ in exactly …

Managing Risks In Information Technology Projects, Boon Siong Neo, Kwong Sin Leong

Research Collection School Of Accountancy

The development and implementation of IT (Information Technology) projects are plagued with problems of cost and time overruns. technical inadequacy, inability to meet user requirements. lack of utilization. and failure to achieve anticipated benefits. These problems occur to some projects and not to others because I) IT projects have different profiles of risk. and 2) IT project risks have been managed more or less effectively. This paper synthesizes the literature into four classes of risks. and applies it to evaluate TradeNet. an EDLbased trading system implemented in Singapore in I989. Through a case study of TradeNet. we derived a typology …

Interpreting The Performance Of Hpf/Fortran 90d, Manish Parashar, Salim Hariri, Tomasz Haupt, Geoffrey C. Fox

Northeast Parallel Architecture Center

In this paper we present a novel interpretive approach for accurate and cost-effective performance prediction in a high performance computing environment, and describe the design of a source-driven HPF/Fortran 90D performance prediction framework based on this approach. The performance prediction framework has been implemented as part of a HPF/Fortran 90D application development environment. A set of benchmarking kernels and application codes are used to validate the accuracy, utility, usability, and cost-effectiveness of the performance prediction framework. The use of the framework for selecting appropriate compiler directives and for application performance debugging is demonstrated. Keywords: Performance prediction, HPF/Fortran 90D application development, …

Run-Time And Compile-Time Support For Adaptive Irregular Problems, Shamik D. Sharma, Ravi Ponnusamy, Bongki Moon, Yuan-Shin Hwang

Northeast Parallel Architecture Center

In adaptive irregular problems the data arrays are accessed via indirection arrays, and data access patterns change during computation. Implementing such problems on distributed memory machines requires support for dynamic data partitioning, efficient preprocessing and fast data migration. This research presents efficient runtime primitives for such problems. This new set of primitives is part of the CHAOS library. It subsumes the previous PARTI library which targeted only static irregular problems. To demonstrate the efficacy of the runtime support, two real adaptive irregular applications have been parallelized using CHAOS primitives: a molecular dynamics code (CHARMM) and a particle-in-cell code (DSMC). The …

Compiling Fortran 90d/Hpf For Distributed Memory Mimd Computers, Zeki Bozkus, Alok Choudhary, Geoffrey C. Fox, Tomasz Haupt

Northeast Parallel Architecture Center

This paper describes the design of the Fortran90D/HPF compiler, a source-to-source parallel compiler for distributed memory systems being developed at Syracuse University. Fortran 90D/HPF is a data parallel language with special directives to specify data alignment and distributions. A systematic methodology to process distribution directives of Fortran 90D/HPF is presented. Furthermore, techniques for data and computation partitioning, communication detection and generation, and the run-time support for the compiler are discussed. Finally, initial performance results for the compiler are presented. We believe that the methodology to process data distribution, computation partitioning, communication system design and the overall compiler design can be …

Supporting Irregular Distributions In Fortran 90d/Hpf Compilers, Ravi Ponnusamy, Yuan-Shin Hwang, Raja Das, Joel Saltz

Northeast Parallel Architecture Center

This paper presents methods that make it possible to efficiently support irregular problems using data parallel languages. The approach involves the use of a portable, compiler-independent, runtime support library called CHAOS. The CHAOS runtime support library contains procedures that (1) support static and dynamic distributed array partitioning, (2) partition loop iterations and indirection arrays, (3) remap arrays from one distribution to another, and (4) carry out index translation, buffer allocation and communication schedule generation. The CHAOS runtime procedures are used by a prototype Fortran 90D compiler as runtime support for irregular problems. This paper also presents performance results of compiler-generated …

A Communication System For High-Performance Distributed Computing, Salim Hariri, Jongbaek Park, Manish Parashar, Geoffrey C. Fox

Northeast Parallel Architecture Center

With the current advances in computer and networking technology coupled with the availability of software tools for parallel and distributed computing, there has been increased interests in high-performance distributed computing (HPDC). We envision that HPDC environments with supercomputing capabilities will be available in the near future. However, a number of issues have to be resolved before future network-based applications can exploit fully the potential of HPDC environment. In this paper, we present an architecture of a high-speed local area network and a communication system that provides HPDC applications with high bandwidth and low latency. We also characterize the message-passing primitives …

Data Access Reorganizations In Compiling Out-Of-Core Data Parallel Programs On Distributed Memory Machines, Rajesh Bordawekar, Alok Choudhary, Rajeev Thakur

Electrical Engineering and Computer Science - All Scholarship

This paper describes techniques for translating out-of-core programs written in a data parallel language like HPF to message passing node programs with explicit parallel I/O. We describe the basic compilation model and various steps involved in the compilation. The compilation process is explained with the help of an out-of-core matrix multiplication program. We first discuss how an out-of-core program can be translated by extending the method used for translating in-core programs. We demonstrate that straightforward extension of in-core compiler does not work for out-of-core programs. We then describe how the compiler can optimize the code by (1) estimating the I/O …

Relationship Between Information System Project Characteristics And Project Management Activities: An Empirical Investigation, Vijay V. Raghavan, Deepak Khazanchi, Joyce L. Webster

Information Systems and Quantitative Analysis Faculty Publications

The activities of a project manager in overseeing the development of a software system are many and varied. Not all such activities are performed in managing every project. If so, a natural ensuing question is whether project managers adapt their managerial functions to the projects being managed. Prior research suggests that they do adapt, and that project characteristics may be the factors determining this adaptation. This assertion is investigated by considering three characteristics of a project (size, type, and environment) and investigating their association with four traditionally recognized management functions (planning, organizing, controlling, and motivating). Results indicate that project managers …

An ‘Events’ Model For Information Aggregation, Douglas Havelka, Deepak Khazanchi

Information Systems and Quantitative Analysis Faculty Publications

Aggregation is one of the key characteristics of information delivered by "information systems." It is important because the ability to design effective support systems depends to a great extent upon the degree of flexibility with regards to information aggregation that can be incorporated in the system. This paper sets forth a conceptual model of information aggregation based on the events theory of accounting. The model suggests that aggregation should be considered as a two-dimensional concept, comprising a temporal and sectional dimension. The two axes are further delineated in the form of "levels of summation" based on specified "events" of aggregation. …

Vic*: A Preprocessor For Virtual-Memory C*, Thomas H. Cormen, Alex Colvin

Computer Science Technical Reports

This paper describes the functionality of ViC*, a compiler-like preprocessor for out-of-core C*. The input to ViC* is a C* program but with certain shapes declared \verb`outofcore`, which means that all parallel variables of these shapes reside on disk. The output is a standard C* program with the appropriate I/O and library calls added for efficient access to out-of-core parallel variables.

Neural Network Diagnosis Of Malignant Melanoma From Color Images, Fikret Erçal, Hsi-Chieh Lee, William V. Stoecker, Randy Hays Moss, Anurag Chawla

Computer Science Faculty Research & Creative Works

Malignant melanoma is the deadliest form of all skin cancers. Approximately 32,000 new cases of malignant melanoma were diagnosed in 1991 in the United States, with approximately 80% of patients expected to survive 5 years. Fortunately, if detected early, even malignant melanoma may be treated successfully, Thus, in recent years, there has been rising interest in the automated detection and diagnosis of skin cancer, particularly malignant melanoma. Here, the authors present a novel neural network approach for the automated separation of melanoma from 3 benign categories of tumors which exhibit melanoma-like characteristics. The approach uses discriminant features, based on tumor …

On The Three Diumensionality Of Motion Correspondence, Anupam Joshi, Zygmunt Pizlo

Department of Computer Science Technical Reports

No abstract provided.

Maintaining Consistency In Multidatabase Systems: A Comprehensive Study, Aidong Zhang, Bharat K. Bhargava

Department of Computer Science Technical Reports

No abstract provided.

Principles And Realization Strategies Of Intregrating Autonomous Software Systems: Extension Of Multidatabase Transaction Management Techniques, Aidong Zhang, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.