Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 9 of 9

Full-Text Articles in Physical Sciences and Mathematics

Resource Access Control For An Internet User Agent, Nataraj Nagaratnam, Steven B. Byrne Jan 1997

Resource Access Control For An Internet User Agent, Nataraj Nagaratnam, Steven B. Byrne

Electrical Engineering and Computer Science - All Scholarship

The rapid increase in the Internet's connectivity has lead to proportional increase in the development of Web-based applications. Usage of downloadable content has proved effective in a number of emerging applications including electronic commerce, software components on-demand, and collaborative systems. In all these cases, Internet user agents (like browsers, tuners) are widely used by the clients to utilize and execute such downloadable content. With this new technology of using downloadable content comes the problem of the downloaded content obtaining unauthorized access to the client's resources. In effect, granting a hostile remote principal the requested access to client's resources may lead …


The Software Architecture Of A Virtual Distributed Computing Environment, Haluk Topcuoglu, Salim Hariri, Wojtek Furmanski, Jon Valente Jan 1997

The Software Architecture Of A Virtual Distributed Computing Environment, Haluk Topcuoglu, Salim Hariri, Wojtek Furmanski, Jon Valente

Electrical Engineering and Computer Science - All Scholarship

The requirements of grand challenge problems and the deployment of gigabit networks makes the network computing framework an attractive and cost effective computing environment with which to interconnect geographically distributed processing and storage resources. Our project, Virtual Distributed Computing Environment (VDCE), provides a problem-solving environment for high-performance distributed computing over wide area networks. VDCE delivers well-defined library functions that relieve end-users of tedious task implementations and also support reusability. In this paper we present the conceptual design of VDCE software architecture, which is defined in three modules: a) the Application Editor, a user-friendly application development environment that generates the Application …


A Compiler Algorithm For Optimizing Locality In Loop Nests, Mahmut Kandemir, J. Ramanujam, Alok Choudhary Jan 1997

A Compiler Algorithm For Optimizing Locality In Loop Nests, Mahmut Kandemir, J. Ramanujam, Alok Choudhary

Electrical Engineering and Computer Science - All Scholarship

This paper describes an algorithm to optimize cache locality in scientific codes on uniprocessor and multiprocessor machines. A distinctive characteristic of our algorithm is that it considers loop and data layout transformations in a unified framework. We illustrate through examples that our approach is very effective at reducing cache misses and tile size sensitivity of blocked loop nests; and can optimize nests for which optimization techniques based on loop transformations alone are not successful. An important special case is the one in which data layouts of some arrays are fixed and cannot be changed. We show how our algorithm can …


Parallel Domain Decomposition And Load Balancing Using Space-Filling Curves, Srinivas Aluru, Faith E. Sevilgen Jan 1997

Parallel Domain Decomposition And Load Balancing Using Space-Filling Curves, Srinivas Aluru, Faith E. Sevilgen

Electrical Engineering and Computer Science - All Scholarship

Partitioning techniques based on space-filling curves have received much recent attention due to their low running time and good load balance characteristics. The basic idea underlying these methods is to order the multidimensional data according to a space-filling curve and partition the resulting one-dimensional order. However, space-filling curves are defined for points that lie on a uniform grid of a particular resolution. It is typically assumed that the coordinates of the points are representable using a fixed number of bits, and the run-times of the algorithms depend upon the number of bits used. In this paper, we present a simple …


An Efficient K-Means Clustering Algorithm, Khaled Alsabti, Sanjay Ranka, Vineet Singh Jan 1997

An Efficient K-Means Clustering Algorithm, Khaled Alsabti, Sanjay Ranka, Vineet Singh

Electrical Engineering and Computer Science - All Scholarship

In this paper, we present a novel algorithm for performing k-means clustering. It organizes all the patterns in a k-d tree structure such that one can find all the patterns which are closest to a given prototype efficiently. The main intuition behind our approach is as follows. All the prototypes are potential candidates for the closest prototype at the root level. However, for the children of the root node, we may be able to prune the candidate set by using simple geometrical constraints. This approach can be applied recursively until the size of the candidate set is one for each …


Selective Crossover: Towards Fitter Offspring, Chilukuri K. Mohan Jan 1997

Selective Crossover: Towards Fitter Offspring, Chilukuri K. Mohan

Electrical Engineering and Computer Science - All Scholarship

A new general-purpose crossover operator is proposed. The representation of a candidate solution is slightly perturbed, and the ensuing changes in fitness are calculated. Such fitness changes (for parents) are used in constructing the offspring resulting from crossover. Experiments with several sets of problems demonstrate that this approach leads to rapid increases in average and best fitness, and performs much better than traditional general-purpose crossover operators.


A Global Computing Environment For Networked Resources, Haluk Topcuoglu, Salim Hariri Jan 1997

A Global Computing Environment For Networked Resources, Haluk Topcuoglu, Salim Hariri

Electrical Engineering and Computer Science - All Scholarship

Current advances in high-speed networks and WWW technologies have made network computing a cost-effective, high-performance computing alternative. New software tools are being developed to utilize efficiently the network computing environment. Our project, called Virtual Distributed Computing Environment (VDCE), is a high-performance computing environment that allows users to write and evaluate networked applications for different hardware and software configurations using a web interface. In this paper we present the software architecture of VDCE by emphasizing application development and specification, scheduling, and execution/runtime aspects.


Simulated Annealing And Genetic Algorithms For Partial Shape Matching, Ender Ozcan, Chilukuri K. Mohan Jan 1997

Simulated Annealing And Genetic Algorithms For Partial Shape Matching, Ender Ozcan, Chilukuri K. Mohan

Electrical Engineering and Computer Science - All Scholarship

Partial shape matching may be viewed as an optimization problem, to be solved using methods such as simulated annealing (SA) and genetic algorithms (GAs). We apply and compare both these methods for 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 [10, 11]. Current results show that both SA and GA succeed in the shape matching task; the GA is faster and yields the global optimum more often than the versions of SA implemented.


Standardization Of A Communication Middleware For High-Performance Real-Time Systems, Arkady Kanevsky, Anthony Skjellum, Jerrell Watts Jan 1997

Standardization Of A Communication Middleware For High-Performance Real-Time Systems, Arkady Kanevsky, Anthony Skjellum, Jerrell Watts

Electrical Engineering and Computer Science - All Scholarship

The last several years saw an emergence of standardization activities for real-time systems including standardization of operating systems (series of POSIX standards [1]), of communication for distributed (POSIX.21 [10]) and parallel systems (MPI/RT [5]) and real-time object management (realtime CORBA [9]). This article describes the ongoing standardization work and implementation of communication middleware for high performance real-time computing. The real-time message passing interface (MPI/RT) advances the non-real-time high-performance communication standard Message Passing Interface Standard (MPI), emphasizing changes that enable and support real-time communication, and is targeted for embedded, fault-tolerant and other real-time systems. MPI/RT is the only communication middleware layer …