On the Data-Accumulating Paradigm

Proceedings of the Joint Conference on Information Sciences

Volumn 4, Issue , 1998, Pages 150-153

  Bruda, Stefan D ^a   Akl, Selim G ^a  

^a QUEEN S UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; FUNCTIONS; MATHEMATICAL MODELS; PARALLEL ALGORITHMS; PROGRAM PROCESSORS; THEOREM PROVING;

DATA-ACCUMULATING PARADIGM; MEMORY FILLING COMPUTATIONS; SEQUENTIAL ALGORITHMS;

PARALLEL PROCESSING SYSTEMS;

EID: 1642304084     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. A. V. Aho, J. E. Hopcroft, J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.
2. S. G. Akl, Parallel Computation: Models and Methods, Prentice-Hall, 1997.
3. S. G. Akl, L. F. Lindon, Paradigms Admitting Superunitary Behaviour in Parallel Computation, Parallel Algorithms and Applications, 11, 1997, 129-153.
4. R. P. Brent, The Parallel Evaluation of General Arithmetic Expressions, Journal of the ACM, 21(2), 1974, 201-206.
5. T.-H. Lai, S. Sahni, Anomalies in Parallel Branch-and-Bound Algorithms, Commun. ACM, 27, 1984, 594-602.
6. F. Luccio, L. Pagli, Computing with Time-Varying Data: Sequential Complexity and Parallel Speed-up, Theory of Computing Systems, 31(1), 1998, 5-26.
7. F. Luccio, L. Pagli, G. Pucci, Three non Conventional Paradigms of Parallel Computation, F. Meyer auf der Heide, B. Monien, A. L. Rosenberg (Eds.) Parallel Architectures and Their Efficient Use, Springer Lecture Notes in Computer Science 678, 1992, 166-175.
8. F. Luccio, L. Pagli, The p-Shovelers Problem (computing with time-varying data), Proceedings of the IEEE Symposium on Parallel and Distributed Processing, 1992, 188-193.
9. J. R. Smith, The Design and Analysis of Parallel Algorithms, Oxford University Press, 1993.