Resource allocation in a client/server hybrid network for virtual world environments

IPDPS Miami 2008 - Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium, Program and CD-ROM

Volumn , Issue , 2008, Pages

  Briceño, Luis Diego ^a   Siegel, Howard Jay ^a,b   Maciejewski, Anthony A ^a   Hong, Ye ^a   Lock, Brad ^a   Teli, Mohammad Nayeem ^b   Wedyan, Fadi ^b   Panaccione, Charles ^b   Zhang, Chen ^b  

^a Department of Mechanical Engineering   (United States)

^b Department of Computer Science   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; COMPUTER RESOURCE MANAGEMENT; CONTROL THEORY; DISTRIBUTED PARAMETER NETWORKS; HEURISTIC METHODS; HEURISTIC PROGRAMMING; PLANNING; RESOURCE ALLOCATION; VIRTUAL REALITY;

CLIENT/SERVER; PARALLEL AND DISTRIBUTED PROCESSING; VIRTUAL WORLD;

SERVERS;

EID: 51049118949     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2008.4536166     Document Type: Conference Paper

References (27)

1. S. Ali, T. D. Braun, H. J. Siegel, A. A. Maciejewski, N. Beck, L. Boloni, M. Maheswaran, A. I. Reuther, J. P. Robertson, M. D. Theys, and B. Yao. Characterizing resource allocation heuristics for heterogeneous computing systems. In Advances in Computers Volume 63: Parallel, Distributed, and Pervasive Computing, pages 91-128, 2005.
2. G. J. Armitage. An experimental estimation of latency sensitivity in multiplayer quake 3. In 11th IEEE International Conference on Networks (ICON '03), pages 137-141, Sept. 2003.
3. L. Barbulescu, L. D. Whitley, and A. E. Howe. Leap before you look: An effective strategy in an oversubscribed scheduling problem. In 19th National Conference on Artificial Intelligence, pages 143-148, July 2004.
4. N. E. Baughman and B. N. Levine. Cheat-proof playout for centralized and distributed online games. In IEEE Conference on Computer Communications (INFOCOM '01), pages 104-113, Mar. 2001.
5. A. Bharambe, J. Pang, and S. Seshan. Colyseus: A distributed architecture for online multiplayer games. In 3rd Symposium on Networked Systems Design and Implementation, pages 155-168, 2006.
6. T. D. Braun, H. J. Siegel, N. Beck, L. Boloni, R. F. Freund, D. Hensgen, M. Maheswaran, A. I. Reuther, J. P. Robertson, M. D. Theys, and B. Yao. A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. Journal of Parallel and Distributed Computing, 61(6):810-837, June 2001.
7. L. D. Briceno, M. Oltikar, H. J. Siegel, and A. A. Maciejewski. Study of an iterative technique to minimize completion times on non-makespan machines. In International Heterogeneity in Computing Workshop (HCW '07), page 138, Mar. 2007.
8. E. Cronin, A. R. Kurc, B. Filstrup, and S. Jamin. An efficient synchronization mechanism for mirrored game architectures. Multimedia Tools Applications, 23(1):7-30, 2004.
9. G. Deen, M. Hammer, J. Bethencourt, I. Eiron, J. Thomas, and J. H. Kaufman. Running quake ii on a grid. IBM Systems Journal, 45(1):21-44, 2006.
10. Q. Ding and G. Chen. A benefit function mapping heuristic for a class of meta-tasks in grid environments. In 1st International Symposium on Cluster Computing and the Grid (CCGRID '01), page 654, May 2001.
11. S. Ghanbari and M. R. Meybodi. On-line mapping algorithms in highly heterogeneous computational grids: A learning automata approach. In International Conference on Information and Knowledge Technology (IKT '05), May 2005.
12. A. Hertz and D. de Werra. The tabu search metaheurstic: How we used it. Annals of Mathematics and Artificial Intelligence, 1(1-4):111-121, Sept. 1990.
13. J. Holland. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence, First Edition. The University of Michigan, 1975.
14. O. H. Ibarra and C. E. Kim. Heuristic algorithms for scheduling independent tasks on non-identical processors. Journal of the ACM, 24(2):280-289, Apr. 1977.
15. T. Iimura, H. Hazeyama, and Y. Kadobayashi. Zoned federation of game servers: a peer-to-peer approach to scalable multi-player online games. In 3rd ACM SIG-COMM workshop on Network and System Support for Games, pages 116-120, Aug. 2004.
16. Z. Jinquan, N. Lina, and J. Changjun. A heuristic scheduling strategy for independent tasks on grid. In Eighth International Conference on High-Performance Computing in Asia-Pacific Region '05, page 6, Nov. 2005.
17. K. Kaya, B. Ucar, and C. Aykanat. Heuristics for scheduling file-sharing tasks on heterogeneous systems with distributed repositories. Journal of Parallel and Distributed Computing, 67(3):271-285, Mar. 2007.
18. J. Kennedy and R. Eberhart. Particle swarm optimization. In IEEE International Conference on Neural Networks, pages 1942-1948, Nov. 1995.
19. J.-K. Kim, H. J. Siegel, A. A. Maciejewski, and R. Eigenmann. Dynamic mapping in energy constrained heterogeneous computing systems. In IEEE International Parallel and Distributed Processing Symposium (IPDPS '05), Apr. 2005.
20. B. Knutsson, H. Lu, W. Xu, and B. Hopkins. Peer-topeer support for massively multiplayer games. In IEEE Conference on Computer Communications (INFOCOM '04), pages 96-107, Mar. 2004.
21. K.-W. Lee, B.-J. Ko, and S. Calo. Adaptive server selection for large scale interactive online games. Computer Networks, 49(1):84-102, Sept. 2005.
22. M. Maheswaran, S. Ali, H. J. Siegel, D. Hensgen, and R. F. Freund. Dynamic mapping of a class of independent tasks onto heterogeneous computing systems. Journal of Parallel and Distributed Computing, 59(2):107-121, Nov. 1999.
23. J. Pugh and A. Martinoli. Discrete multi-valued particle swarm optimization. In IEEE Swarm Intelligence Symposium '06, pages 103-110, May 2006.
24. A. Shaikh, S. Sahu, M.-C. Rosu, M. Shea, and D. Saha. On demand platform for online games. IBM Systems Journal, 45(1):7-20, 2006.
25. V. Shestak, E. K. P. Chong, H. J. Siegel, A. A. Maciejewski, L. Benmohamed, I.-J. Wang, and R. Daley. A hybrid branch-and-bound and evolutionary approach for allocating strings of applications to heterogeneous distributed computing systems. Journal of Parallel and Distributed Computing. accepted, to appear.
26. D. Whitley. The genitor algorithm and selective pressure: Why rank based allocation of reproductive trials is best. In 3rd International Conference on Genetic Algorithms, pages 116-121, June 1989.
27. M. Wu and W. Shu. Segmented min-min: A static mapping algorithm for meta-tasks on heterogeneous computing systems. In 9th IEEE Heterogeneous Computing Workshop (HCW '00), pages 375-385, Mar. 2000.