Optimal resource-aware deployment planning for component-based distributed applications

IEEE International Symposium on High Performance Distributed Computing, Proceedings

Volumn , Issue , 2004, Pages 150-159

  Kichkaylo, Tatiana ^a   Karamcheti, Vijay ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; DATA REDUCTION; FUNCTIONS; PROBLEM SOLVING; WORLD WIDE WEB;

COMPONENT BASED APPROACHES; DISTRIBUTED APPLICATIONS; GRID COMPUTING; MEDIA STREAM DELIVERY;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 4944232663     PISSN: 10828907     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. T. Andrews, F. Curbera, H. Dholakia, Y. Goland, J. Klein, F. Leymann, K. Liu, D. Roller, D. Smith, S. Thatte, I. Trickovic, and S. Weerawarana. Business Process Execution Language for Web Services. http://www-106.ibm.com/ developerworks/library/ws-bpel/, 2003.
2. A. Ankolekar, M. Burstein, J. Hobbs, O. Lassila, D. Martin, S. McIlraith, S. Narayanan, M. Paolucci, T. Payne, K. Sycara, and H. Zeng. DAML-S: Semantic markup for web services. In Semantic Web Working Symposium, 2001.
3. J. Blythe, E. Deelman, Y. Gil, C. Kesselman, A. Agarwal, G. Mehta, and K. Vahi. The role of planning in grid computing. In ICAPS, 2003.
4. M. Do and S. Kambhampati. Sapa: A scalable multiobjective metric temporal planner. JAIR, 2003.
5. X. Fu and V. Karamcheti. Planning for network-aware paths. In DAIS, 2003.
6. X. Fu, W. Shi, A. Akkerman, and V. Karamcheti. CANS: Composable, Adaptive Network Services infrastructure. In USITS, 2001.
7. S. Gribble, M. Welsh, R. von Behren, E. Brewer, D. Culler, N. Borisov, S. Czerwinski, R. Gummadi, J. Hill, A. Joseph, R. Katz, Z. M. Mao, S. Ross, and B. Zhao. The Ninja architecture for robust Internet-scale systems and services. Computer Networks, 35(4):473-497, 2001.
8. A.-A. Ivan, J. Harman, M. Allen, and V. Karamcheti. Partitionable services: A framework for seamlessly adapting distributed applications to heterogenous environments. In HPDC, 2002.
9. H. Kautz and J. Walser. State-space planning by integer optimization. In AAAI, 1999.
10. T. Kichkaylo. Timeless planning and the component placement problem. In ICAPS Workshop on Planning and Scheduling for Web and Grid Services, 2004.
11. T. Kichkaylo, A. Ivan, and V. Karamcheti. Constrained component deployment in wide-area networks using AI planning techniques. In IPDPS, 2003.
12. T. Kichkaylo, A. Ivan, and V. Karamcheti. Sekitei: An AI planner for constrained component deployment in wide-area networks. Technical Report TR2004-851, New York University, 2004.
13. J. Koehler and J. Hoffmann, Handling of inertia in a planning system. Technical Report 122, Albert-Ludwigs-University, 1999.
14. R. Raman, M. Livny, and M. Solomon. Matchmaking: Distributed resource management for high throughput computing. In HPDC, 1998.
15. B. Srivastava. Realplan: Decoupling causal and resource reasoning in planning. In AAAI, 2000.
16. D. Thain, T. Tannenbaum, and M. Livny. Condor and the grid. In Grid Computing: Making the Global Infrastructure a Reality. John Wiley & Sons Inc., 2002.
17. S. Wolfman and D. Weld. Combining linear programming and satisfiability solving for resource planning. The Knowledge Engineering Review, 2001.
18. E. Zegura, K. Calvert, and S. Bhattacharjee. How to model an internetwork. In IEEE Infocom, volume 2, 1996.