{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:15:23Z","timestamp":1759133723907,"version":"3.38.0"},"reference-count":13,"publisher":"SAGE Publications","issue":"4","license":[{"start":{"date-parts":[[2003,11,1]],"date-time":"2003-11-01T00:00:00Z","timestamp":1067644800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The International Journal of High Performance Computing Applications"],"published-print":{"date-parts":[[2003,11]]},"abstract":"<jats:p> Monte Carlo applications are widely perceived as computationally intensive but naturally parallel. Therefore, they can be effectively executed on the Grid using the dynamic bag-of-work model. In this paper we concentrate on analyzing the characteristics of large-scale Monte Carlo computation for Grid computing. Based on these analyses, we improve the efficiency of the subtask-scheduling scheme by implementing and analyzing the \u201cN-out-of-M\u201d strategy, and we develop a Monte-Carlo-specific lightweight checkpoint technique, which leads to a performance improvement for Monte Carlo Grid computing. Also, we enhance the trustworthiness of Monte Carlo Grid-computing applications by utilizing the statistical nature of Monte Carlo and by cryptographically validating intermediate results utilizing the random number generator already in use in the Monte Carlo application. All these techniques lead to a high-performance Grid-computing infrastructure that is capable of providing trustworthy Monte Carlo computation services. <\/jats:p>","DOI":"10.1177\/10943420030174003","type":"journal-article","created":{"date-parts":[[2003,11,11]],"date-time":"2003-11-11T23:39:30Z","timestamp":1068593970000},"page":"369-382","source":"Crossref","is-referenced-by-count":22,"title":["Analysis of Large-Scale Grid-Based Monte Carlo Applications"],"prefix":"10.1177","volume":"17","author":[{"given":"Yaohang","family":"Li","sequence":"first","affiliation":[{"name":"DEPARTMENT OF COMPUTER SCIENCE NORTH CAROLINA A&T STATE UNIVERSITY, GREENSBORO, NORTH CAROLINA, USA"}]},{"given":"Michael","family":"Mascagni","sequence":"additional","affiliation":[{"name":"DEPARTMENT OF COMPUTER SCIENCE AND SCHOOL OF COMPUTATIONAL SCIENCE AND                        INFORMATION TECHNOLOGY, FLORIDA STATE UNIVERSITY, USA"}]}],"member":"179","published-online":{"date-parts":[[2003,11,1]]},"reference":[{"key":"atypb1","doi-asserted-by":"crossref","unstructured":"Aktouf, C., Benkahla, O., Robach, C., and Guran, A. 1998. Basic Concepts and Advances in Fault-Tolerant Computing Design, World Scientific, Singapore .","DOI":"10.1142\/9789812817358_0020"},{"key":"atypb2","doi-asserted-by":"crossref","unstructured":"Beck, M., Dongarra, J., Fagg, G., Geist, A., Gray, P., Kohl, J., Migliardi, M., Moore, K., Moore, T., Papadopoulous, P., Scott, S., and Sunderam, V. 1999. HARESS: a next generation distributed virtual machine . Journal of Future Generation Computer Systems(15).","DOI":"10.1016\/S0167-739X(99)00010-2"},{"key":"atypb3","doi-asserted-by":"crossref","unstructured":"Buyya, R., Chapin, S., and DiNucci, D. 2000. Architectural models for resource management in the Grid. In The First IEEE\/ACM International Workshop on Grid Computing (GRID 2000), Bangalore, India , Springer Verlag LNCS Series, Berlin.","DOI":"10.1007\/3-540-44444-0"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1096-9128(199711)9:11<1139::AID-CPE349>3.0.CO;2-K"},{"key":"atypb5","doi-asserted-by":"crossref","unstructured":"Foster, I., and Kesselman, C. 1997. Globus: A metacomputing infrastructure toolkit . International Journal of Supercomputer Applications 11(2).","DOI":"10.1177\/109434209701100205"},{"key":"atypb6","doi-asserted-by":"crossref","unstructured":"Foster, I., Kesselman, C., and Tueske, S. 2001. The anatomy of the Grid . International Journal of Supercomputer Applications 15(3).","DOI":"10.1177\/109434200101500302"},{"key":"atypb7","doi-asserted-by":"crossref","unstructured":"Korpela, E., Werthimer, D., Anderson, D., Cobb J., and Lebofsky, M. 2001. SETI@home\u2013Massively distributed computing for SETI . Computing in Science and Engineering 3(1): 81-81 .","DOI":"10.1109\/5992.895191"},{"key":"atypb8","unstructured":"Li, Y., Mascagni, M., and Peters, M. H., 2003. Grid-based Non-equilibrium multiple-timescale molecular dynamics\/Brownian dynamics simulations of ligand\u2013receptor interactions in structured protein systems . In Proceedings of the First BioGrid Workshop at the 3rd IEEE\/ACM Symposium Cluster Computing and the Grid, Tokyo, Japan."},{"key":"atypb9","doi-asserted-by":"crossref","unstructured":"Litzkow, M., Livny, M., and Mutka, M., 1998. Condor\u2013A hunter of idle workstations . In Proceedings of the 8th International Conference of Distributed Computing Systems, pp. 104\u2013111 .","DOI":"10.1109\/DCS.1988.12507"},{"key":"atypb10","unstructured":"Livny, M., Basney, J., Raman, R., and Tannenbaum, T. 1997. Mechanisms for high throughput computing . SPEEDUP Journal 11(1)."},{"key":"atypb11","unstructured":"Mascagni, M., Ceperley, D., and Srinivasan, A. 2000. SPRNG: A scalable library for pseudo-random number generation. ACM Transactions on Mathematical Software."},{"key":"atypb12","unstructured":"Sarmenta, L. F. G., 2001. Sabotage-tolerance mechanisms for volunteer computing systems . In Proceeding of ACM\/IEEE International Symposium on Cluster Computing and the Grid (CCGrid\u201901), Brisbane, Australia."},{"key":"atypb13","unstructured":"Srinivasan, A., Ceperley, D. M., and Mascagni, M. 1997. Random number generators for parallel applications. In D. Ferguson, J. I. Siepmann and D. G. Truhlar, editors, Monte Carlo Methods in Chemical Physics, Advances in Chemical Physics Series, Wiley, New York ."}],"container-title":["The International Journal of High Performance Computing Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/10943420030174003","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/10943420030174003","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,3]],"date-time":"2025-03-03T02:32:55Z","timestamp":1740969175000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/10943420030174003"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,11]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,11]]}},"alternative-id":["10.1177\/10943420030174003"],"URL":"https:\/\/doi.org\/10.1177\/10943420030174003","relation":{},"ISSN":["1094-3420","1741-2846"],"issn-type":[{"type":"print","value":"1094-3420"},{"type":"electronic","value":"1741-2846"}],"subject":[],"published":{"date-parts":[[2003,11]]}}}