ACM Home Page
Please provide us with feedback. Feedback
An optimal repartitioning decision policy
Full text PdfPdf (632 KB)
Source Winter Simulation Conference archive
Proceedings of the 17th conference on Winter simulation table of contents
San Francisco, California, United States
Pages: 493 - 497  
Year of Publication: 1985
ISBN:0-911801-07-3
Authors
David M. Nicol  ICASE, Mail Stop 132C, NASA Langley Research Center, Hampton, VA and Department of Computer Science, Thornton Hall, University of Virginia, Charlottesville, Virginia
Paul F. Reynolds, Jr.  Department of Computer Science, Thornton Hall, University of Virginia, Charlottesville, Virginia
Sponsor
SIGSIM: ACM Special Interest Group on Simulation and Modeling
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 8,   Citation Count: 2
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/21850.253429
What is a DOI?

ABSTRACT

The automated partitioning of simulations for parallel execution is a timely research problem. A simulation's run-time performance depends heavily on the nature of the inputs the simulation responds to. Consequently, a simulation's run-time behavior varies as a function of time. Since a simulation's run-time behavior is generally too complex to analytically predict, partitioning algorithms must be statistically based: they base their partitioning decisions on the simulation's observed behavior. Simulations which are partitioned statistically are vulnerable to radical changes in the run-time dynamics of the simulation. In this paper we discuss a dynamic repartitioning decision policy which detects change in a simulation's run-time behavior and reacts to this change. This decision policy optimally balances the costs and potential benefits of repartitioning a running simulation.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
D. Eager, E. Lazowska and J. Zahorjan, Dynamic Load Sharing in Homogeneous Distributed Systems, Tech Report 84-10-01, University of Washington.
 
3
S. Ross, Stochastic Processes, Wiley and Sons, New York, 1983.
 
4
A. Rapoport, W.E. Stein and GJ. Burkheimer, Response Models for Detection of Change, D. Reidel Publishing Company, Boston, 1979.
 
5
Z. Govindarajulu, Sequential Statistical Procedures, Academic Press, 1975.
 
6
G. Fishman, "Grouping Observations in Digital Simulation", Management Science 24, (1978), 510-521.
 
7
H. Bozedogan, S. Sclove, "Multi-Sample Cluster Analysis Using Akaike's Information Criterion~, Annals of the Institute of Statistical Mathematics 36,1, (1983).
 
8
S. Ross, Applied Probabilit3, Models with Optimization Applications, Holden-Day, S~n Fransico, 1970.
 
9
S. Schmitt, An Elementary Introduction to Bayesian Statistics, Addison-Wesley, 1969.
 
10
D. Nicol and P. Reynolds, "A Statistical Approach to Dynamic Partitioning", Proceedings of the SCS Multi-Conference, San Diego, ~anuary 1985, 53-56,

Collaborative Colleagues:
David M. Nicol: colleagues
Paul F. Reynolds, Jr.: colleagues