Influence of network characteristics on application performance in a grid environment

Telecommunication Systems

Volumn 30, Issue 1-3, 2005, Pages 99-121

  Kitatsuji, Yoshinori ^a   Yamazaki, Katsuyuki ^b   Koide, Hiroshi ^c   Tsuru, Masato ^c   Oie, Yuji ^c  

^a NATIONAL INSTITUTE OF INFORMATION AND COMMUNICATIONS TECHNOLOGY   (Japan)

^b KDDI R AND D LABORATORIES INC   (Japan)

^c KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Application level performance; Distributed computing; Grid; Resource allocation; Traffic engineering

Indexed keywords

EID: 29344447532     PISSN: 10184864     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11235-005-4320-5     Document Type: Article

References (15)

1. K. Aida and T. Osumi, A case study in running a parallel branch and bound applications, in Proc. of the 2005 International Symposium on Application and the Internet (SAINT2005) (2005) pp. 164-173.
2. D.H. Bailey, E. Barszcz, J.T. Barton, D.S. Browning, R.L. Carter, L. Dagurm, R.A. Fatoohi, P.O. Federickson, T.A. lasinski, R.S. Schreiber, H.D. Simon, V. Venkatakrishnan and S. K. Weeratunga, The NAS parallel benchmarks, International Journal of Supercomputer Applications 5(3) (1991) 66-73.
3. R. Buyya, High performance cluster computing: Programming and applications, Prentice Hall PTR, Vol 2.(1999).
4. A. Elwalid, C. Jin, S. Low and I. Widjaja, MATE: MPLS adaptive traffic engineering, in Proc. of the Infocom Anchorage (2001) pp. 1300-1309.
5. Empirix Packet Sphere, http://www.empirix.com/
6. I. Foster and C. Kesselman, The GRID Blueprint for a New Computing Infrastructure, Morgan Kaufmann Publishers (1998).
7. I. Foster, C. Kesselman and S. Tuecke, The anatomy of the grid: Enabling scalable virtual organizations, International Journal of Supercomputer Applications 15(3) (2001) 200-222.
8. T. Guven, C. Kommareddy, R. La, M. Shayman and S. Bhattacharjee, Measurement based optimal multi-path routing in Proc. of the Infocom (2004).
9. Iperf - The TCP/UDP Bandwidth Measurement Tool. http://dast.nlanr.net/ Projects/Iperf/
10. R. Kawahara, An adaptive load balancing method for multiple paths using flow statistics and its performance analysis, IEICE Transactions on Communications, Vol. E87-B(7) (2004) 1993-2003.
11. H. Koide and Y. Oie, A new task scheduling method for distributed programs which require memory management in grids, in Proc. of Proposed SAINT2004 Workshop 8: High Performance Grid Computing and Networking (2004) pp. 666-673.
12. N.S.V. Rao, NetLets: End-to-end qos mechanisms for distributed computing in wide-area networks using two-paths, in Proc. of the First International Conference on Internet Computing (2001) pp. 475-478.
13. A. Plaat, H.E. Bal and R.F.H. Hofman, Sensitivity of parallel applications to large differences in bandwidth and latency in two-layer interconnects, in Proc. of the 5th High Perfromance Computer Architecture (1999) pp. 244-253.
14. The ACM International Collegiate Programming Contest Japan Domestics. (2001). Probrem C Jigsaw Puzzle for Computers http://www.fun.ac.jp/icpc/ domestic_problems.html
15. T. Tobita and H. Kasahara, A standard task graph set for fair evaluation of multiprocessor scheduling algorithms, Journal of Scheduling 5(5) (2002) 379-394.