3600 search results - page 281 / 720 » The settling-time reducibility ordering |
191
click to vote
MPC
1995
Springer
15 years 10 months ago
1995
Springer
Abstract. We present a strategy to develop, in a functional setting, correct, e cient and portable Divide-and-Conquer (DC) programs for massively parallel architectures. Starting f...
157
click to vote
ISCA
1991
IEEE
15 years 10 months ago
1991
IEEE
This paper describes a parallel associative processor, IXM2, developed mainly for semantic network processing. IXM2 consists of 64 associative processors and 9 network processors,...
182
click to vote
VLDB
1991
ACM
15 years 10 months ago
1991
ACM
This paper describes some of the concurrency control 1” lgorithms used in RdMVMS RdbIVMS uses the ,fac.ilities provided by the VMS lock manager in order to perform locking among...
191
click to vote
VLDB
1991
ACM
15 years 10 months ago
1991
ACM
In order to cope efficiently with simple or complex queries as well as different application requirements (e.g., ad-hoc versus repetitive queries), a query optimizer ought to supp...
163
click to vote
PODS
1989
ACM
15 years 10 months ago
1989
ACM
In this paper we propose the use of fractals and especially the Hilbert curve, in order to design good distance-preserving mappings. Such mappings improve the performance of secon...