- 期刊
- OpenAccess
Optimal Parallel Prefix on the Postal Model
並列摘要
This paper explores the prefix operation on a message-passing frilly connected multicomputer with multiport postal communication. We present an exact communication lower bound for the prefix operation on the model. Two efficient parallel prefix algorithms are also presented; they are optimal in terms of the number of communication steps. For an input of size n, one of the algorithms using n processors is also time-optimal; the other algorithm using p＜n processors can be cost-optimal and can achieve linear speedup.
延伸閱讀
- Abdou, A. A. N. (2013). One-Local Retract and Common Fixed Point in Modular Metric Spaces. Abstract and Applied Analysis, 2013(), 647-654-862. https://doi.org/10.1155/2013/672069
- Chen, Y. A. (2014). Minimal Model Program in Positive Characteristic [master's thesis, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU.2014.00827
- Liu, P., & Wang, C. (2012). Robust Semiparametric Optimal Testing Procedure for Multiple Normal Means. Journal of Probability and Statistics, 2012(), 819-832. https://doi.org/10.1155/2012/913560
- 吳承芳（2011）。Optimal design for nonlinear models.〔碩士論文，國立清華大學〕。華藝線上圖書館。https://doi.org/10.6843/NTHU.2011.00665
- Lee, C. C. I., Liu, L., & Peng, J. (2005). A One-Sided Multiple Comparison Procedure in Restricted Normal Models. 中國統計學報, 43(4), 433-449. https://doi.org/10.29973/JCSA.200512.0005