Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Physical Sciences and Mathematics
Parallel Algorithm Fundamentals And Analysis, Bruce M. Mcmillin, Hanan Lutfiyya, Grace Tsai, Jun-Lin Liu
Parallel Algorithm Fundamentals And Analysis, Bruce M. Mcmillin, Hanan Lutfiyya, Grace Tsai, Jun-Lin Liu
Computer Science Technical Reports
This session explores, through the use of formal methods, the “intuition” used in creating a parallel algorithm design and realizing this design on distributed memory hardware. The algorithm class NC and the LSTM machine are used to show why some algorithms realize their promise of speedup better than others and the algorithm class NP is used to show why other algorithms will never be good for parallelization. Performance and correctness through cooperative axiomatic reasoning and temporal reasoning provide an additional basis for understanding parallel algorithm design and specification. Finally, the realities of algorithm design are presented through partitioning and mapping …
Parallel Algorithm Fundamentals And Analysis, Bruce M. Mcmillin, Hanan Lutfiyya, Grace Tsai, Jun-Lin Liu
Parallel Algorithm Fundamentals And Analysis, Bruce M. Mcmillin, Hanan Lutfiyya, Grace Tsai, Jun-Lin Liu
Computer Science Technical Reports
This session explores, through the use of formal methods, the “intuition” used in creating a parallel algorithm design and realizing this design on distributed memory hardware. The algorithm class NG and the LSTM machine are used to show why some algorithms realize their promise of speedup better than others and the algorithm class NP is used to show why other algorithms will never be good for parallelization. The realities of algorithm design are presented through partitioning and mapping issues and models. Finally, correctness through cooperative axiomatic reasoning provides an additional basis for understanding parallel algorithm design and specification and is …
Binary Resolution In Surface Reasoning, William C. Purdy
Binary Resolution In Surface Reasoning, William C. Purdy
Electrical Engineering and Computer Science - Technical Reports
Intuition suggests the hypothesis that everyday human reasoning is conducted in the written or spoken natural language, rather than in some disparate representation into which the surface language is translated. An examination of human reasoning reveals patterns of inference that parallel binary resolution. But any standard implementation of resolution requires Skolemization. Skolemization would seem an unlikely component of human reasoning. This appears to contradict the hypothesis that human reasoning takes place at the surface. To reconcile these observations, this paper develops a new rule of inference, which operates on surface expressions directly. This rule is shown to produce results which …