Search
Now showing items 161-170 of 219
Networks in distributed computing
(American Mathematical Society, 1999)
Impact of timing on linearizability in counting networks
(IEEE, 1997)
Counting networks form a new class of distributed, low-contention data structures, made up of interconnected balancers and are suitable for solving a variety of multiprocessor synchronization problems that can be expressed ...
The impact of timing on linearizability in counting networks
(Max-Planck-Institut für Informatik, 1996)
Addressing network survivability issues by finding the K-best paths through a trellis graph
(IEEE, 1997)
Due to the increasing reliance of our society on the timely and reliable transfer of large quantities of information (such as voice, data, and video) across high speed communication networks, it is becoming important for ...
Sub-optimal solutions to track detection problem using graph theoretic concepts
(1997)
This paper demonstrates how the problem of tracking targets, which appear as either straight or curved lines in two-dimensional display images (or data images) can be formulated in terms of a directed weighted graph model ...
Parallel computing using Java mobile agents
(1999)
We propose a mobile-agent parallel processing framework that uses multiple Java mobile agents, each one of which utilizes multithreading. A mobile agent can travel at any Web site to perform its tasks. We also introduce ...
Net-console: A web-based development environment for MPI programs
(1999)
In this paper we describe Net-console, a Web-based environment for the development of Message Passing Interface (MPI) programs. Using Net-console the user is able to write, execute, debug and evaluate the performance of ...
Mobile agents for WWW distributed database access
(1999)
The popularity of Web as a universal access mechanism for network information has created the need for developing web-based DBMS client/server applications. However, the current commercial applet-based methodologies for ...