Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleAugust 2002
Universal stability of undirected graphs in the adversarial queueing model
SPAA '02: Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architecturesPages 183–197https://doi.org/10.1145/564870.564903In this paper we study the universal stability of undirected graphs in the adversarial queueing model for packet routing. In this setting, packets must be injected in some edge and have to traverse a path before leaving the system. Restrictions on the ...
- ArticleAugust 2002
Verifying sequential consistency using vector clocks
SPAA '02: Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architecturesPages 153–154https://doi.org/10.1145/564870.564897We present an algorithm for dynamically verifying that the execution of a multithreaded program is sequentially consistent. The algorithm uses a vector-timestamp logical time mechanism to construct and verify the acyclic nature of an execution's ...
- ArticleAugust 2002
AT2L2 o N2/2 for fast fourier transform in multilayer VLSI
SPAA '02: Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architecturesPages 145–146https://doi.org/10.1145/564870.564893In this paper, we show that N-point fast Fourier transform (FFT) circuits with throughput 1 (i.e., time 1 after pipelining) can be optimally laid out with area N2/(4⌊ L2/2 ⌋) + o(N2/L2) under the multilayer 2-D grid model, where only one active layer (...
- ArticleAugust 2002
Optimal organizations for pipelined hierarchical memories
SPAA '02: Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architecturesPages 109–116https://doi.org/10.1145/564870.564886In a recent paper (SPAA'01), we have established that the Pipelined Hierarchical Random Access Machine (PH-RAM) is a powerful model of computation, where most of the memory latency can be hidden by concurrency of accesses. In the present work, we ...
