155
click to vote
IPPS
1998
IEEE
16 years 18 hour ago
1998
IEEE
Several fast sequential algorithms have been proposed in the past to multiply sparse matrices. These algorithms do not explicitlyaddresstheimpactofcachingonperformance. We show th...
158
Voted
IPPS
1998
IEEE
16 years 18 hour ago
1998
IEEE
We present a method by which any polynomial-time randomized distributed algorithm is transformed in such way that each participating process needs only polylog local random bits a...
230
click to vote
IPPS
1998
IEEE
16 years 18 hour ago
1998
IEEE
In this paper the problem of fault-tolerant message routing in two-dimensional meshes, with each inner node having 4 neighbors, is investigated. It is assumed that some nodes/links...
227
click to vote
IPPS
1998
IEEE
16 years 18 hour ago
1998
IEEE
Single System Image (SSI) Distributed Operating Systems have been the subject of increasing interest in recent years. This interest has been fueled primarily by the trend towards ...
170
click to vote
IPPS
1998
IEEE
16 years 18 hour ago
1998
IEEE
The Loop-Level Process Control LLPC policy 9 dynamically adjusts the number of threads an application is allowed to execute based on the application's available parallelism a...
205
click to vote
IPPS
1998
IEEE
16 years 18 hour ago
1998
IEEE
In this paper we extend a previously introduced method for optimizing the arbitration policy employed by ServerNet routers and we evaluate the method's effect on scalability....
195
click to vote
IPPS
1998
IEEE
16 years 18 hour ago
1998
IEEE
Given an (undirected) graph G = V; E; a clique of G is a subset of vertices in which every pair is connected by an edge. The problem of finding a clique of maximum size is a class...
197
Voted
IPPS
1998
IEEE
16 years 18 hour ago
1998
IEEE
Rapidly deployable wireless networks consist of mobile base stations and less powerful mobile hosts. The mobile base stations have to maintain wireless connectivity while on the mo...