Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Keyword
-
- Java (5)
- Concurrent computing (3)
- Dynamic load balancing (3)
- Genetic algorithms (2)
- Granularity (2)
-
- HPDC (2)
- Irregular applications (2)
- JWORB (2)
- Network computing (2)
- Particle simulations (2)
- Pragmatic Object Web (2)
- SPMD (2)
- 25th ACM National Conference (1)
- Application Editor (1)
- Applicative language (1)
- Attributed strings (1)
- Bottlenecks (1)
- C++ (1)
- CLOUDS (1)
- COM (1)
- CORBA (1)
- Classification (1)
- Closure (1)
- Communication (1)
- Computer science curriculum (1)
- Computer science programs (1)
- Computer security (1)
- Continuation (1)
- Continuous media server (1)
- Crossover operators (1)
Articles 1 - 30 of 30
Full-Text Articles in Computer Sciences
Definitional Interpreters For Higher-Order Programming Languages, John C. Reynolds
Definitional Interpreters For Higher-Order Programming Languages, John C. Reynolds
College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects
Abstract. Higher-order programming languages (i.e., languages in which procedures or labels can occur as values) are usually defined by interpreters that are themselves written in a programming language based on the lambda calculus (i.e., an applicative language such as pure LISP). Examples include McCarthy’s definition of LISP, Landin’s SECD machine, the Vienna definition of PL/I, Reynolds ’ definitions of GEDANKEN, and recent unpublished work by L. Morris and C. Wadsworth. Such definitions can be classified according to whether the interpreter contains higher-order functions, and whether the order of application (i.e., call by value versus call by name) in the defined …
Dynamic Management Of Heterogeneous Resources, Jerrell Watts, Marc Rieffel, Stephen Taylor
Dynamic Management Of Heterogeneous Resources, Jerrell Watts, Marc Rieffel, Stephen Taylor
College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects
This paper presents techniques for dynamic load balancing in heterogeneous computing environments. That is, the techniques are designed for sets of machines with varying processing capabilities and memory capacities. These methods can also be applied to homogenous systems in which the effective compute speed or memory availability is reduced by the presence of other programs running outside the target computation. To handle heterogeneous systems, a precise distinction is made between an abstract quantity of work, which might be measured as the number of iterations of a loop or the count of some data structure, and the utilization of resources, measured …
Skew-Insensitive Parallel Algorithms For Relational Join, Khaled Alsabti, Sanjay Ranka
Skew-Insensitive Parallel Algorithms For Relational Join, Khaled Alsabti, Sanjay Ranka
College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects
Join is the most important and expensive operation in relational databases. The parallel join operation is very sensitive to the presence of the data skew. In this paper, we present two new parallel join algorithms for coarse grained machines which work optimally in presence of arbitrary amount of data skew. The first algorithm is sort-based and the second is hash-based. Both of these algorithms employ a preprocessing phase (prior to the redistribution phase) to equally partition the work among the processors. The proposed algorithms have been designed for memory resident-data. However, they can be extended to disk resident-data. These algorithms …
Visual Interactive Modeling In A Java-Based Hierarchical Modeling And Simulation System, Robert G. Sargent, Thorsten Daum
Visual Interactive Modeling In A Java-Based Hierarchical Modeling And Simulation System, Robert G. Sargent, Thorsten Daum
College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects
The desired set of properties of a modern simulation system is presented. The portion of the Hierarchical Modeling And Simulation System-Java (HiMASS-j) used for specifying Hierarchical Control Flow Graph (HCFG) Models is described. The specification of HCFG Models in HiMASS-j is by visual interactive modeling through the use of graphical user interfaces and dialog boxes. HCFG Models are specified using two complementary hierarchical specification structures: one to specify the components that comprise a model and how these components are interconnected, and the other to specify the behaviors of individual atomic components. A simulation of a traffic intersection using HiMASS-j is …
Towards A Java Environment For Spmd Programming, Bryan Carpenter, Guansong Zhang, Geoffrey C. Fox, Xiaoming Li
Towards A Java Environment For Spmd Programming, Bryan Carpenter, Guansong Zhang, Geoffrey C. Fox, Xiaoming Li
Northeast Parallel Architecture Center
As a relatively straightforward object-oriented language, Java is a plausible basis for a scientific parallel programming language. We outline a conservative set of language extensions to support this kind of programming. The programming style advocated is Single Program Multiple Data (SPMD), with parallel arrays added as language primitives. Communications involving distributed arrays are handled through a standard library of collective operations. Because the underlying programming model is SPMD programming, direct calls to other communication packages are also possible from this language.
A High Level Spmd Programming Model: Hpspmd And Its Java Language Binding, Guansong Zhang, Bryan Carpenter, Geoffrey C. Fox, Xinying Li
A High Level Spmd Programming Model: Hpspmd And Its Java Language Binding, Guansong Zhang, Bryan Carpenter, Geoffrey C. Fox, Xinying Li
Northeast Parallel Architecture Center
This report introduces a new language, HPJava, for parallel programming on message passing systems. The language provides a high level SPMD programming model. Through examples and performance results, the features of the new programming style, and its implementation, are illustrated.
Language Bindings For A Data-Parallel Runtime, Bryan Carpenter, Geoffrey C. Fox, Donald Leskiw, Xinying Li, Yuhong Wen
Language Bindings For A Data-Parallel Runtime, Bryan Carpenter, Geoffrey C. Fox, Donald Leskiw, Xinying Li, Yuhong Wen
Northeast Parallel Architecture Center
The NPAC kernel runtime, developed in the PCRC (Parallel Compiler Runtime Consortium) project, is a runtime library with special support for the High Performance Fortran data model. It provides array descriptors for a generalized class of HPF-like distributed arrays, support for parallel access to their elements, and a rich library of collective communication and arithmetic operations for manipulating these arrays. The library has been successfully used as a component in experimental HPF translation systems. With prospects for early appearance of fully-featured, efficient HPF compilers looking questionable, we discuss a class of more easily implementable data-parallel language extensions that preserve many …
Jworb - Java Web Object Request Broker For Commodity Software Based Visual Data Ow Metacomputing Programming Environment, Geoffrey C. Fox, Wojtek Furmanski, Hasan T. Ozdemir
Jworb - Java Web Object Request Broker For Commodity Software Based Visual Data Ow Metacomputing Programming Environment, Geoffrey C. Fox, Wojtek Furmanski, Hasan T. Ozdemir
Northeast Parallel Architecture Center
Programming environments and tools that are simultaneously sustainable, highly functional, robust and easy to use have been hard to come by in the HPDC area. This is partially due to the difficulty in developing sophisticated customized systems for what is relatively small part of the worldwide computing enterprise. As the commodity software becomes naturally distributed with the onset of Web and Intranets, we observe now a new trend in HPDC community [1, 8, 12] to base high performance computing on the modern enterprise computing technologies. .. JWORB is a multi-protocol Java server under development at NPAC, currently capable of handling …
Considerations In Hpjava Language Design And Implementation, Guansong Zhang, Bryan Carpenter, Geoffrey C. Fox, Xinying Li, Yuhong Wen
Considerations In Hpjava Language Design And Implementation, Guansong Zhang, Bryan Carpenter, Geoffrey C. Fox, Xinying Li, Yuhong Wen
Northeast Parallel Architecture Center
This paper discusses some design and implementation issues in the HPJava language. The language is briefly reviewed, then the class library that forms the foundation of the translation scheme is described. Through example codes, we illustrate how HPJava source codes can be translated straightforwardly to ordinary SPMD Java programs calling this library. This is followed by a discussion of the rationale for introducing the language in the first place, and of how various language features have been designed to facilitate efficient implementation.
Java/Corba Based Real-Time Infrastructure To Integrate Event-Driven Simulations, Collaboration And Distributed Object/Componentware Computing, Geoffrey C. Fox, Wojtek Furmanski, Hasan T. Ozdemir
Java/Corba Based Real-Time Infrastructure To Integrate Event-Driven Simulations, Collaboration And Distributed Object/Componentware Computing, Geoffrey C. Fox, Wojtek Furmanski, Hasan T. Ozdemir
Northeast Parallel Architecture Center
We are discussing the four major standard candidates for distributed object/componentware computing: Java, CORBA, COM and WOM within our proposed coordination framework we call Pragmatic Object Web (POW). We describe our integration approach based on multi-protocol middleware server JWORB (Java Web Object Request Broker) that currently integrates HTTP and IIOP and which we now further develop to also support COM and WOM core functionalities. We are also experimenting with visual data ow authoring front-ends using NPAC WebFlow system on top of JWORB based software bus. Finally, we illustrate our technologies in one major application domain- DoD Modeling and Simulation- where …
Common Runtime Support For High Performance Languages, Geoffrey C. Fox
Common Runtime Support For High Performance Languages, Geoffrey C. Fox
Northeast Parallel Architecture Center
Widespread adoption of parallel computing depends on the availability of improved software environments. An essential component of these environments will be high-level languages. Several languages for exploiting data-parallelism (or task-parallelism) have been developed, or are under development. The stated goal of this project has been to provide a public domain infrastructure for runtime support of these high-level languages. The targeted languages include parallel versions of Fortran and C++, but our intention has been to provide uniform runtime support for many source languages.
Darp: Java-Based Data Analysis And Rapid Prototyping Environment For Distributed High Performance Computations, Erol Akarsu, Geoffrey C. Fox, Tomasz Haupt
Darp: Java-Based Data Analysis And Rapid Prototyping Environment For Distributed High Performance Computations, Erol Akarsu, Geoffrey C. Fox, Tomasz Haupt
Northeast Parallel Architecture Center
The integration of a compiled and interpreted HPF gives us an opportunity to design a powerful application development environment targeted for high performance parallel and distributed systems. This Web based system follows a three-tier model. The Java front-end holds proxy objects which can be manipulated with an interpreted Web client (a Java applet) interacting dynamically with compiled code through a tier-2 server. Although targeted for HPF back-end, the system’s architecture is independent of the back-end language, and can be extended to support other high performance languages.
Techniques For Empirical Testing Of Parallel Random Number Generators, Paul D. Coddington, Sung-Hoon Ko
Techniques For Empirical Testing Of Parallel Random Number Generators, Paul D. Coddington, Sung-Hoon Ko
Northeast Parallel Architecture Center
Parallel computers are now commonly used for computational science and engineering, and many applications in these areas use random number generators. For some applications, such as large-scale Monte Carlo simulations, it is crucial that the random number generator have good randomness properties. Many programs are available for testing the quality of sequential random number generators, but very little work has been done on testing parallel random number generators. We present some techniques for empirical testing of random number generators on parallel computers, using tests based on computational science applications as examples. In particular, we focus on tests based on parallel …
Object Web (Java/Corba) Based Rti To Support Metacomputing M&S, Geoffrey C. Fox, Wojtek Furmanski, Hasan T. Ozdemir
Object Web (Java/Corba) Based Rti To Support Metacomputing M&S, Geoffrey C. Fox, Wojtek Furmanski, Hasan T. Ozdemir
Northeast Parallel Architecture Center
We present here our Pragmatic Object Web based approach to High Performance Modeling and Simulation and we describe the associated middleware software recently prototyped at NPAC: JWORB (Java Web Object Request Broker) which integrates HTTP and IIOP protocols, and Object Web RTI which implements DMSO RTI 1.3 on top of the JWORB based CORBA / Java software bus. We explain how JWORB and OW RTI are used to build WebHLA – an interactive FMS training environment and we outline our plan towards WebHLA based Virtual Prototyping Environments for Testing, Evaluation and Simulation Based Acquisition.
Verification And Validation Of Simulation Models, Robert G. Sargent
Verification And Validation Of Simulation Models, Robert G. Sargent
Electrical Engineering and Computer Science - All Scholarship
This paper discusses verification and validation of simulation models. The different approaches to deciding model validity are presented; how model verification and validation relate to the model development process are discussed; various validation techniques are defined; conceptual model validity, model verification, operational validity, and data validity are described; ways to document results are given; and a recommended procedure is presented.
A Global Communication Optimization Technique Based On Data-Flow Analysis And Linear Algebra, Mahmut Kandemir, P. Banerjee, Alok Choudhary, J. Ramanujam
A Global Communication Optimization Technique Based On Data-Flow Analysis And Linear Algebra, Mahmut Kandemir, P. Banerjee, Alok Choudhary, J. Ramanujam
Electrical Engineering and Computer Science - All Scholarship
Reducing communication overhead is extremely important in distributed-memory message-passing architectures. In this paper, we present a technique to improve communication that considers data access patterns of the entire program. Our approach is based on a combination of traditional data-flow analysis and a linear algebra framework, and works on structured programs with conditional statements and nested loops but without arbitrary goto statements. The distinctive features of the solution are the accuracy in keeping communication set information, support for general alignments and distributions including block-cyclic distributions and the ability to simulate some of the previous approaches with suitable modifications. We also show …
Clouds: A Decision Tree Classifier For Large Datasets, Khaled Alsabti, Sanjay Ranka, Vineet Singh
Clouds: A Decision Tree Classifier For Large Datasets, Khaled Alsabti, Sanjay Ranka, Vineet Singh
Electrical Engineering and Computer Science - All Scholarship
Classification for very large datasets has many practical applications in data mining. Techniques such as discretization and dataset sampling can be used to scale up decision tree classifiers to large datasets. Unfortunately, both of these techniques can cause a significant loss in accuracy. We present a novel decision tree classifier called CLOUDS, which samples the splitting points for numeric attributes followed by an estimation step to narrow the search space of the best split. CLOUDS reduces computation and I/O complexity substantially compared to state of the art classifiers, while maintaining the quality of the generated trees in terms of accuracy …
Design, Implementation, And Evaluation Of Parallell Pipelined Stap On Parallel Computers, Alok Choudhary, Wei-Keng Liao, Donald Weiner, Pramod Varshney, Richard Linderman, Mark Linderman
Design, Implementation, And Evaluation Of Parallell Pipelined Stap On Parallel Computers, Alok Choudhary, Wei-Keng Liao, Donald Weiner, Pramod Varshney, Richard Linderman, Mark Linderman
Electrical Engineering and Computer Science - All Scholarship
Performance results are presented for the design and implementation of parallel pipelined space-time adaptive processing (STAP) algorithms on parallel computers. In particular, the issues involved in parallelization, our approach to parallelization, and performance results on an Intel Paragon are described. The process of developing software for such an application on parallel computers when latency and throughput are both considered together is discussed and tradeoffs considered with respect to inter and intratask communication and data redistribution are presented. The results show that not only scalable performance was achieved for individual component tasks of STAP but linear speedups were obtained for the …
Adaptive Linkage Crossover, Ayed A. Salman, Kishan Mehrotra, Chilukuri K. Mohan
Adaptive Linkage Crossover, Ayed A. Salman, Kishan Mehrotra, Chilukuri K. Mohan
Electrical Engineering and Computer Science - All Scholarship
Problem-specific knowledge is often implemented in search algorithms using heuristics to determine which search paths are to be explored at any given instant. As in other search methods, utilizing this knowledge will more quickly lead a genetic algorithm (GA) towards better results. In many problems, crucial knowledge is not found in individual components, but in the interrelations between those components. For such problems, we develop an interrelation (linkage) based crossover operator that has the advantage of liberating GAs from the constraints imposed by the fixed representations generally chosen for problems. The strength of linkages between components of a chromosomal structure …
A Multithreaded Message-Passing System For High Performance Distributed Computing Applications, Sung-Yong Park, Joohan Lee, Salim Hariri
A Multithreaded Message-Passing System For High Performance Distributed Computing Applications, Sung-Yong Park, Joohan Lee, Salim Hariri
Electrical Engineering and Computer Science - All Scholarship
High Performance Distributed Computing (HPDC) applications require low-latency and high-throughput communication services and HPDC applications have different Quality of Service (QOS) requirements (e.g., bandwidth requirement, flow/error control algorithms, etc.). The communication services provided by traditional message-passing systems are fixed and thus can not be changed to meet the requirements of different HPDC applications. NYNET (ATM wide area network testbed in New York state) Communication System (NCS) is a multithreaded message-passing system developed at Syracuse University that provides high-performance and flexible communication services. In this paper, we overview the general architecture of NCS and present how NCS communication services are implemented. …
Steady State Memetic Algorithm For Partial Shape Matching, Ender Ozcan, Chilukuri K. Mohan
Steady State Memetic Algorithm For Partial Shape Matching, Ender Ozcan, Chilukuri K. Mohan
Electrical Engineering and Computer Science - All Scholarship
Shape matching techniques are important in machine intelligence, especially in applications such as robotics. Currently, there are three major approaches to shape recognition: statistical, syntactic and neural approaches. This paper presents a fourth approach: evolutionary algorithms. A steady state memetic algorithm is shown to be successful in matching shapes even when they are partially obscured, and even in the presence of noise in the input image.
Integrating Security Into The Curriculum, Cynthia E. Irvine, Shiu-Kai Chin, Deborah Frincke
Integrating Security Into The Curriculum, Cynthia E. Irvine, Shiu-Kai Chin, Deborah Frincke
Electrical Engineering and Computer Science - All Scholarship
The number of skilled practitioners of computer security who are able to address the complexities of modern technology and are familiar with successful approaches to system security is very small. People want security but are faced with two difficulties. First, they do not know how to achieve it in the context of their enterprises. They may not even know of a way to translate organizational procedures into policies, much less implement a set of mechanisms to enforce those policies. Second, they have no way of knowing whether their chosen mechanisms are effective. The recent US Presidential Commission on Critical Infrastructure …
Partial Shape Matching Using Genetic Algorithms, Ender Ozcan, Chilukuri K. Mohan
Partial Shape Matching Using Genetic Algorithms, Ender Ozcan, Chilukuri K. Mohan
Electrical Engineering and Computer Science - All Scholarship
Shape recognition is a challenging task when images contain overlapping, noisy, occluded, partial shapes. This paper addresses the task of matching input shapes with model shapes described in terms of features such as line segments and angles. The quality of matching is gauged using a measure derived from attributed shape grammars. We apply genetic algorithms to the partial shape-matching task. Preliminary results, using model shapes with 6 to 70 features each, are extremely encouraging.
The Design And Evaluation Of A Virtual Distributed Computing Environment, Haluk Topcuoglu, Salim Hariri, Dongmin Kim, Yoonhee Kim, Xue Bing
The Design And Evaluation Of A Virtual Distributed Computing Environment, Haluk Topcuoglu, Salim Hariri, Dongmin Kim, Yoonhee Kim, Xue Bing
Electrical Engineering and Computer Science - All Scholarship
In this paper we present the Virtual Distributed Computing Environment (VDCE), a metacomputing environment currently being developed at Syracuse University. VDCE provides an efficient web-based approach for developing, evaluating and visualizing large-scale distributed applications that are based on predefined task libraries on diverse platforms. The VDCE task libraries relieve end-users of tedious task implementations and also support reusability. The VDCE software architecture is described in terms of three modules: a) the Application Editor, a user-friendly application development environment that generates the Application Flow Graph (AFG) of an application; b) the Application Scheduler, which provides an efficient task-to-resource mapping of AFG; …
An Efficient Parallel Algorithm For High Dimensional Similarity Join, Khaled Alsabti, Sanjay Ranka, Vineet Singh
An Efficient Parallel Algorithm For High Dimensional Similarity Join, Khaled Alsabti, Sanjay Ranka, Vineet Singh
Electrical Engineering and Computer Science - All Scholarship
Multidimensional similarity join finds pairs of multi-dimensional points that are within some small distance of each other: The 6-k-d-B tree has been proposed as a data structure that scales better as the number of dimensions in-creases compared to previous data structures. We present a cost model of the E-k-d-B tree and use it to optimize the leaf size. We present novel parallel algorithms for the similarity join using the E-k-d-B tree. A load-balancing strategy based on equi-depth histograms is shown to work well for uniform or low-skew situations, whereas another based on weighted equi-depth histograms works far better for high-skew …
Secure Delegation For Distributed Object Environments, Nataraj Nagaratnam, Doug Lea
Secure Delegation For Distributed Object Environments, Nataraj Nagaratnam, Doug Lea
Electrical Engineering and Computer Science - All Scholarship
SDM is a Secure Delegation Model for Java-based distributed object environments. SDM extends current Java security features to support secure remote method invocations that may involve chains of delegated calls across distributed objects. The framework supports a control API for application developers to specify mechanisms and security policies surrounding simple or cascaded delegation. Delegation may also be disabled and optionally revoked. These policies may be controlled explicitly in application code, or implicitly via administrative tools.
A Problem Solving Environment For Network Computing, Salim Hariri, Haluk Topcuoglu, Wojtek Furmanski, Dongmin Kim, Yoonhee Kim
A Problem Solving Environment For Network Computing, Salim Hariri, Haluk Topcuoglu, Wojtek Furmanski, Dongmin Kim, Yoonhee Kim
Electrical Engineering and Computer Science - All Scholarship
The current advances in high-speed networks and WWW technologies have made network computing a cost-effective high performance computing environment. New software development models and problem solving environments must be developed to utilize the network computing environment efficiently. In this paper we present Virtual Distributed Computing Environment (VDCE), which provides a problem solving environment for high-performance distributed computing over wide-area networks. VDCE enables scientists to develop distributed applications without knowing the detailed architecture of the underlying resources. VDCE provides well-defined library functions that relieve end users from tedious task implementations and it supports software reusability. The VDCE software architecture consists of …
Automatic Granularity Control For Load Balancing Of Concurrent Particle Simulations, Marc Rieffel, Stephen Taylor, Jerrell Watts
Automatic Granularity Control For Load Balancing Of Concurrent Particle Simulations, Marc Rieffel, Stephen Taylor, Jerrell Watts
Electrical Engineering and Computer Science - All Scholarship
This paper demonstrates the use of automatic granularity control as part of dynamic load balancing for irregular, particle-based simulations. Performance optimization techniques are considered in the context of a concurrent Direct Simulation Monte Carlo method used to study the rarefied gas flow inside three-dimensional plasma reactors. Several computational techniques are used to reduce the overall time to deliver realistic threedimensional results. The effectiveness of dynamic load balancing and granularity control are presented for large-scale simulations on distributed-memory multicomputers.
Automatic Granularity Control For Load Balancing Of Concurrent Particle Simulations, Marc Rieffel, Stephen Taylor, Jerrell Watts
Automatic Granularity Control For Load Balancing Of Concurrent Particle Simulations, Marc Rieffel, Stephen Taylor, Jerrell Watts
Electrical Engineering and Computer Science - All Scholarship
This paper demonstrates the use of automatic granularity control as part of dynamic load balancing for irregular, particle-based simulations. Performance optimization techniques are considered in the context of a concurrent Direct Simulation Monte Carlo method used to study the rarefied gas flow inside three-dimensional plasma reactors. Several computational techniques are used to reduce the overall time to deliver realistic threedimensional results. The effectiveness of dynamic load balancing and granularity control are presented for large-scale simulations on distributed-memory multicomputers.
Performance Enhancement Using Intra-Server Caching In A Continuous Media Server, Chutimet Srinilta, Alok Choudhary
Performance Enhancement Using Intra-Server Caching In A Continuous Media Server, Chutimet Srinilta, Alok Choudhary
Electrical Engineering and Computer Science - All Scholarship
Continuity of stream playback is the crucial constraint in designing a continuous media server. From a distributed memory architectural model developed earlier, we found that there were many points where the stream capacity of the server could be improved. The stream capacity was usually limited by the storage bottlenecks. Serving streams from memory cache eliminates disk accesses and data transfers between nodes which, in turn, helps relieve those bottlenecks. However, the capacity of the server ultimately depends on client access pattern. Client request assignment has an impact on cache hit ratio as well as workload distribution. It is also the …