Computation-at-risk: Employing the grid for computational risk management

Proceedings - IEEE International Conference on Cluster Computing, ICCC

Volumn , Issue , 2004, Pages 347-352

  Kleban, Stephen D ^a   Clearwater, Scott H ^b  

^a SANDIA NATIONAL LABORATORIES   (United States)

^b NONE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SIMULATION; COMPUTER SYSTEMS; MARKETING; RESOURCE ALLOCATION; STRATEGIC PLANNING;

CLUSTERS; FINANCIAL MARKETS; RESOURCE UTILIZATION; TRADEOFFS;

RISK MANAGEMENT;

EID: 20444507944     PISSN: 15525244     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CLUSTR.2004.1392633     Document Type: Conference Paper

References (14)

1. W. Cirne and F. Berman "Adaptive Selection of Partition Size for Supercomputer Requests" Lecture Notes in Computer Science, Vol. 1911, pp. 187-206 (2000).
2. K. Dowd "Beyond Value at Risk" Wiley, New York (1998).
3. D. Feitelson "Sensitivity of Parallel Job Scheduling to Fat-Tailed Distributions" Technical Report 2000-44, Inst. Computer Science, The Hebrew University of Jerusalem, Oct 2000 and http://www.cs.huji.ac.il/~feit/pub.html.
4. H. E. Hurst, "Long-term Storage Capacity of Reservoirs", Trans. Amer. Soc. Civ. Eng. Vol. 116 (1951) pp.770-799.
5. J. Kay and P. Lauder, "A Fair Share Scheduler" Communications of the ACM, vol. 31 pp.44-55 (1988).
6. S. D. Kleban and S. H. Clearwater "Quelling Queue Storms" 12th International Symposium on High-Performance Distributed Computing, HPDC-12, Seattle, June 22-24 pp. 162-171 (2003).
7. S. D. Kleban and S. H. Clearwater, "Fair Share on High Performance Computing Systems: What Does Fair Really Mean?" 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, CCGRID-2003, Tokyo, May 12-15 (2003).
8. S. D. Kleban and S. H. Clearwater "Hierarchical Dynamics, Interarrival Times, and Performance" 23rd International Conference for High Performance Computing and Networking, SC2003. Phoenix, AZ, Nov. 15-21 (2003).
9. S. D. Kleban and S. H. Clearwater "Computation-at-Risk: Assessing Job Portfolio Management Risk on Clusters" 18th International Parallel and Distributed Processing Symposium, IPDPS-2004, Santa Fe, April 26-30 (2004).
10. V. Leung, E. M. Arkin, et al. "Processor Allocation on CPlant: Achieving General Processor Locality Using One-Dimensional Allocation Strategies" Sandia Technical Report, SAND02002-1488C (2002).
11. B. B. Mandelbrot, "Fast fractional Gaussian noise generator", Water Resources Research, Vol. 7 (1971) pp.543-553.
12. R. C. Merton "Continuous-Time Finance" Blackwell, Oxford (1992).
13. G. A. Paleologo "Price-at-Risk: A methodology for pricing utility computing services" IBM Systems Journal, Vol. 43 (2004).
14. J. Skovira, J. W. Chan, H. Zhou, D. and Lifka, 'The EASY-LoadLeveler API Project", D. G. Feitelson and L. Rudolph, (eds.), Proceedings of 2nd Workshop on Job Scheduling Strategies for Parallel Processing, vol. 1162, Springer Verlag, 1996, pp. 41-47.