Now showing items 1-10 of 35
PATHALIAS or The Care and Feeding of Relative Addresses
(Center for Information Technology Integration, 1986-06)
Pathalias computes electronic mail routes in environments that mix explicit and implicit routing, as well as syntax styles. We describe the history of pathalias, its algorithms and data structures, and our design decisions ...
Genetic Algorithms and Machine Learning
(Kluwer Academic Publishers-Plenum Publishers; Kluwer Academic Publishers ; Springer Science+Business Media, 1988-10)
Task granularity studies on a many-processor CRAY X-MP
(Elsevier, 1985-06)
A hybrid granularity model is proposed for general concurrent solution. It is applied to the triangular factorization of a dense matrix ranging in size from 4 to 1024. Concurrency is achieved at two levels: (1) with small ...
Supporting divide-and-conquer algorithms for image processing
(Elsevier, 1987-02)
Divide-and-conquer is an important algorithm strategy, but it is not widely used in image processing. For higher-level, symbolic operations it should often be the strategy of choice for parallel computers. It is natural ...
A logic for constant-depth circuits
(Elsevier, 1984-04)
Consider a family of boolean circuitsC1,C2,...,Cn,..., constructed by some uniform, effective procedure operating on inputn. Such a procedure provides a concise representation of a family of parallel algorithms for computing ...
An optimization of queries in distributed database systems
(Elsevier, 1986-06)
This paper addresses the processing of a query in distributed database systems using a sequence of semijoins. The objective is to minimize the intersite data traffic incurred by a distributed query. A method is developed ...
On the relationships between Scott domains, synchronization trees, and metric spaces
(Elsevier, 1985)
We use Scott's idea of information systems to provide a complete partial order semantics for concurrency involving Milner's synchronization tree model. Several connections are investigated between different models; our ...
The decentralized wald problem
(Elsevier, 1987-04)
Two detectors making independent observations must decide which one of two hypotheses is true. The decisions are coupled through a common cost function. It is shown that the detectors' optimal decisions are characterized ...
Embeddings in hypercubes
(Elsevier, 1988)
One important aspect of efficient use of a hypercube computer to solve a given problem is the assignment of subtasks to processors in such a way that the communication overhead is low. The subtasks and their inter-communication ...