We give an example of a computational problem for which no RAM (random access machine) can ensure a non-trivial garbage collection though a large amount of used memory can be in principle freed starting from some time moment. This example is of theoretical nature and means only that there can be no universal algorithm for ‘sufficiently good’ realtime garbage collection applicable in all situati...

i This work was supported in part by MIC & IITA through IT Leading R&D Support Project. ii This work was supported in part by grant No. R01-2004-000-10188-0 from the Basic Research Program of the Korea Science & Engineering Foundation. Abstract Nonvolatile memory technology is evolving continuously and commercial products such as FeRAM and PRAM are now appearing in the market. As Nonvolatile-RA...

Parallel algorithms for shared-memory machines. In J. 27] Y. Matias and U. Vishkin. Converting high probability into nearly-constant time|with applications to parallel hashing. 6] O. Berkman and Y. Matias. Fast parallel algorithms for minimum and related problems with small integer inputs. 11] J. Edmonds. Lower bounds with smaller domain size on concurrent write parallel machines. Lower bounds ...

Output queued switches are appealing because they have better latency and throughput than input queued switches. However, they are difficult to build: a direct implementation of an N × N output-queued switch requires the switching fabric and the packet memories at the outputs to run at N times the line rate. Attempts have been made to implement output queuing with slow components, e.g., by havi...

In this paper, a Computational Random Access Memory (C*RAM) implementation of MPEG-2 video compression standard is presented. This implementation has the advantage of processing image/video data in parallel and directly in the frame buffers. Therefore, savings in execution time and I/O bandwidth due to massively parallel on-chip computation and reduction in the data transfer among chips is achi...

We analyze the fine structure of time complexity classes for RAM's, in particular the equivalence relation A:c B (A and B have the same time complexity") ++ (for ali time constructible / : Ae DTIMEn,cM(Í) ë B e DTIMEaa¡a(/))' The -c-equivalence class of A is called its complexity type. 'We prove that every set X can be partitioned into two sets ,4. and B such that X :c A :c B, and that the part...

A parallel algorithm for diffusion-limited aggregation (DLA) is described and analyzed from the perspective of computational complexity. The dynamic exponent z of the algorithm is defined with respect to the probabilistic parallel random-access machine (PRAM) model of parallel computation according to T ∼ L z , where L is the cluster size, T is the running time, and the algorithm uses a number ...

We develop some general techniques for converting randomized parallel algorithms into deterministic parallel algorithms without a blowup in the number of processors. One of the requirements for the application of these techniques is that the analysis of the randomized algorithm uses only pairwise independence. Our main new result is a parallel algorithm for coloring the vertices of an undirecte...

This paper presents results for the queue-read, queue-write asynchronous parallel random access machine (qrqw asynchronous pram) model, which is the asynchronous variant of the qrqw pram model. The qrqw pram family of models, which was introduced earlier by the authors, permit concurrent reading and writing to shared memory locations, but each memory location is viewed as having a queue which c...

Kirousis, L.M., Fast parallel constraint satisfaction (Research Note), Artificial Intelligence 64 (1993) 147-160. We describe a class of constraint satisfaction problems (CSPs) for which a global solution can be found by a fast parallel algorithm. No relaxation preprocessing is needed for the parallel algorithm to work on this class of CSPs. The result is motivated from the problem of labelling...