Some parallelalgorithms have the property that, as they are allowed to take more time, the total work that they do is reduced. This paper describes three such algorithms that find the strongly connected components of...
详细信息
parallel randomized algorithms are presented that solve n-dimensional systems of linear equations and compute inverses of n × n non-singular matrices over a field in O((log n)2) time, where each time unit represe...
详细信息
Non-blocking networks have many applications in communications. Typical examples are telephone switching networks and communication networks among processors or between processors and memory devices. We construct non-...
详细信息
A collection of local workpiles (task queues) and a simple load balancing scheme is well suited for scheduling tasks in shared memory parallel machines. Task scheduling on such machines has usually been done through a...
详细信息
Resource Allocation is one of the interesting problems in a high speed multiprocess/multiresource environment. In this paper, we present two novel parallel resource allocation algorithms using macro-pipeline architect...
详细信息
We present a number of efficient parallelalgorithms for constructing 2- and 3-dimensional convex hulls on a randomized CRCW PRAM. Specifically, we show how to build the convex hull of n pre-sorted points in the plane...
详细信息
We present several algorithms for sorting efficiently with parallel two-level and multilevel memories. Our main result is an elegant, easy-to-implement, optimal, deterministic algorithm for external sorting with P dis...
详细信息
We present efficient parallelalgorithms for the problems of finding a minimal 2-edge-connected spanning subgraph of a 2-edge-connected graph and finding a minimal biconnected spanning subgraph of a biconnected graph....
详细信息
We will show that Lovasz number of graphs may be computed using interior-point methods. This technique will require O(√|V|) iterations, each consisting of matrix operations which have polylog parallel time complexity...
详细信息
The problem of packet routing on an r-dimensional mesh-connected array or grid of processors with side-length n is studied. Each processor is able to store rf(n) packets, f(n) 1-1/r. The new class of balanced routing ...
详细信息
暂无评论