{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T22:56:54Z","timestamp":1777676214318,"version":"3.51.4"},"reference-count":51,"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>Computational Grids lend themselves well to parameter sweep applications, in which independent tasks calculate results for points in a parameter space. However, it is possible for a parameter space to become so large as to pose prohibitive system requirements. In these cases, user-guided searchespromise to reduce overall computation time. In this paper, we address an interesting challenge posed by these user-directed searches: how should computing resources be allocated to application tasks as the overall computation is being guided by the user? We present a model for user-guided searches, and then propose a number of resource allocation strategies and evaluate them in simulation. We find that prioritizing the assignments of tasks to computing resources throughout the search can lead to substantial performance improvements.<\/jats:p>","DOI":"10.1177\/10943420030174004","type":"journal-article","created":{"date-parts":[[2003,11,11]],"date-time":"2003-11-11T18:39:30Z","timestamp":1068575970000},"page":"383-402","source":"Crossref","is-referenced-by-count":2,"title":["Resource Allocation Strategies for Guided Parameter Space Searches"],"prefix":"10.1177","volume":"17","author":[{"given":"Marcio","family":"Faerman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adam","family":"Birnbaum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francine","family":"Berman","sequence":"additional","affiliation":[{"name":"SAN DIEGO SUPERCOMPUTER CENTER"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henri","family":"Casanova","sequence":"additional","affiliation":[{"name":"DEPT. OF COMPUTER SCIENCE AND ENGINEERING, UNIVERSITY OF CALIFORNIA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2003,11,1]]},"reference":[{"key":"atypb1","unstructured":"Abramson, D., Sosic, R., Giddy, J., and Hall, B., 1995. Nimrod: A tool for performing parametrized simulations using distributed workstations . In Proceedings of the 4th IEEE Symposium on High Performance Distributed Computing."},{"key":"atypb2","unstructured":"Aldous, D., and Vazirani, U., 1994. Go with the winners\u2019 algorithms . In Proceedings of the 35th IEEE Symposium on Foundations of Computer Science."},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-2836(05)80360-2"},{"key":"atypb4","doi-asserted-by":"crossref","unstructured":"Back, T. 1996. Evolutionary Algorithms in Theory and Practice, Oxford University Press, Oxford .","DOI":"10.1093\/oso\/9780195099713.003.0007"},{"key":"atypb5","unstructured":"Baluja, S. 1995. An empirical comparison of seven iterative and evolutionary function optimization heuristics. Technical report, Carnegie Mellon University ."},{"key":"atypb6","doi-asserted-by":"crossref","unstructured":"Baluja, S., and Caruana, R., 1995. Removing the genetics from the standard genetic algorithm . In Proceedings of the 12th International Conference on Machine Learning.","DOI":"10.1016\/B978-1-55860-377-6.50014-1"},{"key":"atypb7","unstructured":"Basney, J., Livny, M., and Mazzanti, P., 2000. Harnessing the capacity of computational Grids for high energy physics . In Conference on Computing in High Energy and Nuclear Physics."},{"key":"atypb8","unstructured":"Beynon, M., Ferreira, R., Kurc, T.M., Sussman, A., and Saltz, J.H., 2000. DataCutter: Middleware for filtering very large scientific datasets on archival storage systems . In IEEE Symposium on Mass Storage Systems, pp. 119\u2013134 ."},{"key":"atypb9","unstructured":"Casanova, H., 2001. Simgrid: A Toolkit for the simulation of application scheduling . In Proceedings of the IEEE\/ACM International Symposium on Cluster Computing and the Grid."},{"key":"atypb10","unstructured":"Casanova, H., Bartol, T., Berman, F., Birnbaum, A., Dongarra, J., Ellisman, M., Faerman, M., Gockay, E., Miller, M., Obertelli, G., Pomerantz, S., Sejnowski, T., Stiles, J., and Wolski, R. 2002. The Virtual Instrument: Support for Grid-enabled scientific simulations. Technical Report CS2002-0707, Department of Computer Science and Engineering, University of California, San Diego, CA ."},{"key":"atypb11","doi-asserted-by":"crossref","unstructured":"Casanova, H., Bartol, T., Stiles, J., and Berman, F. 2001. Distributing MCell simulations on the Grid . The International Journal of High Performance Computing Applications 14(3): 243\u2013257 .","DOI":"10.1177\/109434200101500304"},{"key":"atypb12","doi-asserted-by":"crossref","unstructured":"Casanova, H., Obertelli, G., Berman, F., and Wolski, R., 2000a. The AppLeS parameter sweep template: User-level middleware for the Grid . In Proceedings of Supercomputing.","DOI":"10.1109\/SC.2000.10061"},{"key":"atypb13","doi-asserted-by":"crossref","unstructured":"Casanova, H., Legrand, A., Zagorodnov, D., and Berman, F., 2000b. Heuristics for scheduling parameter sweep applications in Grid environments . In Proceedings of the 9th Heterogeneous Computing Workshop (HCW\u201900), pp. 349\u2013363 .","DOI":"10.1109\/HCW.2000.843757"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1080\/00207160210939"},{"key":"atypb15","doi-asserted-by":"crossref","unstructured":"Durbin, R., Eddy, S., Krogh, A., and Mitchison, G.J. 1998. Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids, A tutorial introduction to hidden Markov models and other probabilistic modelling approaches in computational sequence analysis, Cambridge University Press, Cambridge .","DOI":"10.1017\/CBO9780511790492"},{"key":"atypb16","doi-asserted-by":"crossref","unstructured":"Faerman, M., 2003. Resource Allocation for Guided Parameter Search Applications on High Performance Parallel Computing Environments. PhD thesis, University of California, San Diego, CA.","DOI":"10.1177\/10943420030174004"},{"key":"atypb17","doi-asserted-by":"crossref","unstructured":"Faerman, M., Birnbaum, A., Casanova, H., and Berman, F., 2002. Resource allocation for steerable parallel parameter searches . In Proceedings of the 3rd International Workshop on Grid Computing, Lecture Notes in Computer Science Vol. 2536, Springer-Verlag, Berlin, pp. 157\u2013168 .","DOI":"10.1007\/3-540-36133-2_14"},{"key":"atypb18","doi-asserted-by":"crossref","unstructured":"Feitelson, D.G., and Jette, M.A. 1997. Improved utilization and responsiveness with gang scheduling. In D. G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, Springer Verlag, Berlin , pp. 238\u2013261.","DOI":"10.1007\/3-540-63574-2_24"},{"key":"atypb19","doi-asserted-by":"crossref","unstructured":"Feitelson, D.G., Rudolph, L., Schwiegelshohn, U., Sevcik, K.C., and Wong, P. 1997. Theory and practice in parallel job scheduling. In D. G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, Springer-Verlag, Berlin , pp. 1\u201334.","DOI":"10.1007\/3-540-63574-2_14"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1177\/109434209701100305"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1007\/BF00933356"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1411"},{"key":"atypb23","unstructured":"Hart, W.E., 1994. Adaptive Global Optimization with Local Search. PhD thesis, University of California, San Diego, CA."},{"key":"atypb24","unstructured":"Hart, W.E., and Belew, R.K. 1996. Optimization with genetic algorithm hybrids that use local search. In Adaptive Individuals in Evolving Populations, Models and Algorithms, Addison-Wesley, Reading, MA , pp. 483\u2013494."},{"key":"atypb25","doi-asserted-by":"publisher","DOI":"10.1137\/0914050"},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1997.5.1.31"},{"key":"atypb27","doi-asserted-by":"publisher","DOI":"10.1109\/3477.990871"},{"key":"atypb28","unstructured":"Land, M.W.S., 1998. Evolutionary Algorithms with Local Search for Combinatorial. PhD thesis, University of California, San Diego, CA."},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevB.60.6320"},{"key":"atypb30","doi-asserted-by":"crossref","unstructured":"Majumdar, A., 2000. Parallel performance study of Monte Carlo photon transport code on shared- distributed- and distributed-shared-memory architectures . In Proceedings of the 14th Parallel and Distributed Processing Symposium, IPDPS\u201900,pp. 93\u201399 .","DOI":"10.1109\/IPDPS.2000.845969"},{"key":"atypb31","doi-asserted-by":"crossref","unstructured":"Mathias, K.E., and Whitley, D., 1994a. Initial performance comparisons for the delta coding algorithm . In International Conference on Evolutionary Computation, pp. 433\u2013438 .","DOI":"10.1109\/ICEC.1994.349911"},{"key":"atypb32","doi-asserted-by":"crossref","unstructured":"Mathias, K.E., and Whitley, D., 1994b. Transforming the search space with gray coding . In International Conference on Evolutionary Computation, pp. 513\u2013518 .","DOI":"10.1109\/ICEC.1994.349897"},{"key":"atypb33","doi-asserted-by":"crossref","unstructured":"Michalewicz, Z., and Fogel, D. 2000. How to Solve It: Modern Heuristics, Springer, Berlin .","DOI":"10.1007\/978-3-662-04131-4"},{"key":"atypb34","doi-asserted-by":"crossref","unstructured":"Milano, M., Schmidhuber, J., and Koumoutsakos, P. 2001. Active Learning with Adaptive Grids, Lecture Notes in Computer Science Vol. 2130, p. 436-436.","DOI":"10.1007\/3-540-44668-0_61"},{"key":"atypb35","unstructured":"Natrajan, A., Crowley, M., Wilkins-Diehr, N., Humphrey, M., Fox, A., and Grimshaw, A., 2001. Studying protein folding on the Grid: Experiences using CHARM on NPACI resources under legion . In Proceedings of the 10th IEEE International Symposium on High-Performance Distributed Computing (HPDC-10)."},{"key":"atypb36","doi-asserted-by":"crossref","unstructured":"Parker, S., and Johnson, C., 1995. SCIRun: a scientific programming environment for computational steering . In Proceedings of the 1995 ACM\/IEEE Supercomputing Conference.","DOI":"10.1145\/224170.224354"},{"key":"atypb37","unstructured":"Potter, M.A., 1997. The Design and Analysis of a Computational Model of Cooperative Coevolution. PhD thesis, George Mason University, Fairfax, VA."},{"key":"atypb38","unstructured":"Rastrigin, L.A. 1974. Systems of Extremal Control, Nauka, Moscow (in Russian)."},{"key":"atypb39","doi-asserted-by":"crossref","unstructured":"Rogers, S., and Ywak, D. 1991. Steady and unsteady solutions of the incompressible Navier\u2013Stokes equations . AIAA Journal 29(4): 603610-603610 .","DOI":"10.2514\/3.10627"},{"key":"atypb40","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/3.3.175"},{"key":"atypb41","doi-asserted-by":"publisher","DOI":"10.1016\/0303-2647(96)01621-8"},{"key":"atypb42","doi-asserted-by":"crossref","unstructured":"Stiles, J.R., and Bartol, T.M. 2001. Monte Carlo methods for simulating realistic synaptic microphysiology using MCell. In Computational Neuroscience\u2013Realistic Modeling for Experimentalists, chapter 4, CRC Press, Boca Raton, FL . MCell online information available at http:\/\/www.mcell.cnl.salk.edu.","DOI":"10.1201\/9781420039290.ch4"},{"key":"atypb43","doi-asserted-by":"crossref","unstructured":"Torn, A., and Zilinskas, A. 1989. Global Optimization, Lecture Notes in Computer Science Vol. 350, Springer-Verlag, Berlin .","DOI":"10.1007\/3-540-50871-6"},{"key":"atypb44","unstructured":"Tsutsui, S., Pelikan, M., and Goldberg, D.E. 2001. Evolutionary algorithm using marginal histogram in continuous domain. In Optimization by Building and Using Probabilistic Models (OBUPM) 2001, San Francisco, CA , pp. 230\u2013233."},{"key":"atypb45","unstructured":"van den Bergh, F., and Engelbrecht, A.P., 2001. Effects of swarm size on cooperative particle swarm optimizers . In L. Spector et al., editors, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), San Francisco, CA, Morgan Kaufmann, San Mateo, CA, pp. 892\u2013899 ."},{"key":"atypb46","doi-asserted-by":"crossref","unstructured":"van Laarhoven, P., and Aarts, E. 1987. Simulated Annealing: Theory and Applications, Reidel, Dordrecht .","DOI":"10.1007\/978-94-015-7744-1"},{"key":"atypb47","unstructured":"Vetter, J., and Schwan, K., 1995. Progress: a toolkit for interactive program steering . In Proceedings of the 1995 International Conference on Parallel Processing."},{"key":"atypb48","unstructured":"Voigt, H., and Lange, J., 1998. Local evolutionary search enhancement by random memorizing . In Proceedings of the 1998 IEEE World Congress on Computational Intelligence\u2013The 1998 IEEE International Conference on Evolutionary Computation(ICEC\u201998), IEEE Press, Piscataway, NJ."},{"key":"atypb49","unstructured":"Waldspurger, C., 1995. Lottery and Stride Scheduling: Flexible Proportional-Share Resource Management. PhD thesis, Massachusetts Institute of Technology."},{"key":"atypb50","unstructured":"Waldspurger, C.A., and Weihl, W.E., 1995. Lottery scheduling: flexible proportional-share resource management . In Proceedings of the 1st Symposium on Operating Systems Design and Implementation."},{"key":"atypb51","doi-asserted-by":"crossref","unstructured":"Yarrow, M., McCann, K., Biswas, R., and Van der Wijngaart, R., 2000. An advanced user interface approach for complex parameter study process specification on the information power Grid . In Proceedings of GRID 2000, Bangalore, India.","DOI":"10.1007\/3-540-44444-0_14"}],"container-title":["The International Journal of High Performance Computing Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/10943420030174004","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/10943420030174004","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T08:18:01Z","timestamp":1777450681000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/10943420030174004"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,11]]},"references-count":51,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,11]]}},"alternative-id":["10.1177\/10943420030174004"],"URL":"https:\/\/doi.org\/10.1177\/10943420030174004","relation":{},"ISSN":["1094-3420","1741-2846"],"issn-type":[{"value":"1094-3420","type":"print"},{"value":"1741-2846","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,11]]}}}