Title
Parallel Algorithm For Bound-Smoothing
Abstract
A parallel algorithm for bound-smoothing, employing the tetrangle inequality, is proposed. An implementation of this parallel algorithm on the Intel Paragon XP/S and its performance are also discussed.
Publication Date
1-1-1999
Publication Title
Proceedings of the International Parallel Processing Symposium, IPPS
Number of Pages
645-652
Document Type
Article
Personal Identifier
scopus
Copyright Status
Unknown
Socpus ID
0032657589 (Scopus)
Source API URL
https://api.elsevier.com/content/abstract/scopus_id/0032657589
STARS Citation
Rajan, Kumar and Deo, Narsingh, "Parallel Algorithm For Bound-Smoothing" (1999). Scopus Export 1990s. 4000.
https://stars.library.ucf.edu/scopus1990/4000
COinS