Abstract
The design and analysis of complex systems need to determine suitable configurations for meeting requirement constraints. The Monotonic Indices Space (MIS) method is a useful approach for monotonic requirement space exploration. However, the method is highly time and memory-Consuming. Aiming to the problem of low efficiency of sequential MIS method, this paper introduces a coarse-grained parallel execution mechanism to the MIS method for accelerating the process of requirement space exploration. The task pool model is used to receive and deploy hyperboxes for work balancing. To validate our approach, the speedup is estimated by a mathematical analysis and then an experiment is conducted in a PC cluster environment. The results show that high speedup and efficiency is achieved through our approach.
Chapter PDF
Similar content being viewed by others
References
Bouthonnier, V., Levis, A.H.: System Effectiveness Analysis of C3 Systems. IEEE Trans On Systems, Man, and Cybernetics 14(1), 48–54 (1984)
Levis, A.H., et al.: Effectiveness Analysis of Automotive System. Lab. Inf. Decision Syst. MIT, Cambridge (1984)
Christine, B.M.: Computer Graphics for System Effectiveness Analysis. M.S.thesis, Dept. Elect. Eng. Comput. Sci. MIT, Cambridge (1986)
Hu, J.W., Hu, X., Zhang, W.: Monotonic Indices Space Method and Its Application in the Capability Indices effectiveness analysis of a Notional Anti-Stealth Information System. IEEE Transaction on System, Man, Cybernetics Part A 39(2), 404–413 (2009)
Hu, J.W.: Analysis and design of search for weapon system indices. National Defense Industry Press, Beijing (2009)
Prediction Measurement. New York: WSEIAC, Final Report of Task Group 2, 1,2,3 (January 1965)
Hwang, C.L., et al.: Multiple Attribute Decision Making. Springer, Berlin (1981)
Dehne, F., Fabri, A., Rau-Chaplin, A.: Scalable Parallel Computational Geometry For Coarse Grained Multicomputers. International Journal of Computational Geometry & Applications 6(3), 379–400 (1996)
Dehne, F., Maheshwari, A., Taylor, R.: A Coarse Grained Parallel Algorithm for Hausdorff Voronoi Diagrams. In: Proceedings of the 2006 International Conference on Parallel Processing, ICPP 2006 (2006)
Garcia, T., Sem’, D.: A Coarse-Grained Multicomputer algorithm for the Longest Repeated Suffix Ending at Each Point in a Word. In: 11-th Euromicro Conference on Parallel Distributed and Network Based Processing (PDP 2003)
Chan, A., Dehne, F., Rau-Chaplin, A.: Coarse Grained Parallel Geometric Search. Journal of Parallel and Distributed Computing 57, 224–235 (1999)
Dinan, J., Brian Larkins, D., Krishnamoorthy, S., Nieplocha, J.: Scalable Work Stealing. In: Proceeding SC 2009 Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis. ACM, New York (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 IFIP International Federation for Information Processing
About this paper
Cite this paper
Lin, Z., Yao, Y. (2011). Accelerating the Requirement Space Exploration through Coarse-Grained Parallel Execution. In: Altman, E., Shi, W. (eds) Network and Parallel Computing. NPC 2011. Lecture Notes in Computer Science, vol 6985. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24403-2_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-24403-2_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24402-5
Online ISBN: 978-3-642-24403-2
eBook Packages: Computer ScienceComputer Science (R0)