메뉴 건너뛰기




Volumn 5, Issue 3, 2009, Pages

Dynamic load balancing for I/O-intensive applications on clusters

Author keywords

Clusters; Heterogeneity; I O intensive applications; Load balancing; Storage systems

Indexed keywords

ANALYTIC MODELS; BATCH SCHEDULERS; CHOLESKY; COMPUTING POWER; DISK SPEED; DYNAMIC LOAD BALANCING; HETEROGENEOUS CLUSTERS; HOMOGENEOUS CLUSTER; I/O-INTENSIVE APPLICATIONS; LOAD-BALANCING; LOAD-BALANCING SCHEMES; LU DECOMPOSITION; MEMORY CAPACITY; MEMORY LOAD; MEMORY RESOURCES; PARALLEL APPLICATION; PARALLEL JOBS; PARALLEL TEXT; PERFORMANCE CHARACTERISTICS; PERFORMANCE IMPROVEMENTS; SEQUENTIAL JOBS; STORAGE SYSTEMS; SYSTEM LEVELS; TRANSFER PROCESS; WIDE SPECTRUM;

EID: 72449176435     PISSN: 15533077     EISSN: 15533093     Source Type: Journal    
DOI: 10.1145/1629075.1629078     Document Type: Article
Times cited : (23)

References (46)
  • 5
    • 0032591263 scopus 로고    scopus 로고
    • A comparison study of static mapping heuristics for a class of meta-tasks on heterogeneous computing systems
    • IEEE Computer Society, Los Alamitos, CA
    • BRAUN, T. D., SIEGAL, H. J., AND BECK, ET AL. 1999. A comparison study of static mapping heuristics for a class of meta-tasks on heterogeneous computing systems. In Proceedings of the 8th Heterogeneous Computing Workshop (HCW'99). IEEE Computer Society, Los Alamitos, CA, 15.
    • (1999) Proceedings of the 8th Heterogeneous Computing Workshop (HCW'99) , pp. 15
    • Braun, T.D.1    Siegal, H.J.2    Beck3
  • 6
    • 0018707154 scopus 로고
    • M/g/1 round robin discipline
    • BROWN, T. 1979. M/g/1 round robin discipline. Computing 22, 3, 225-241.
    • (1979) Computing , vol.22 , Issue.3 , pp. 225-241
    • Brown, T.1
  • 9
    • 84978368551 scopus 로고
    • Wsclock-a simple and effective algorithm for virtual memory management
    • CARR, R. W. AND HENNESSY, J. L. 1981. Wsclock-a simple and effective algorithm for virtual memory management. SIGOPS Oper. Syst. Rev. 15, 5, 87-95.
    • (1981) SIGOPS Oper. Syst. Rev. , vol.15 , Issue.5 , pp. 87-95
    • Carr, R.W.1    Hennessy, J.L.2
  • 11
    • 0036669133 scopus 로고    scopus 로고
    • On load balancing for distributed multiagent computing
    • CHOW, K.-P. ANDKWOK, Y.-K. 2002. On load balancing for distributed multiagent computing. IEEE Trans. Parall. Distrib. Syst. 13, 8, 787-801.
    • (2002) IEEE Trans. Parall. Distrib. Syst. , vol.13 , Issue.8 , pp. 787-801
    • Chow, K.-P.1    Kwok, Y.-K.2
  • 13
    • 37549003336 scopus 로고    scopus 로고
    • Mapreduce: Simplified data processing on large clusters
    • DEAN, J. AND GHEMAWAT, S. 2008. Mapreduce: Simplified data processing on large clusters. Comm. ACM 51, 1, 107-113.
    • (2008) Comm. ACM , vol.51 , Issue.1 , pp. 107-113
    • Dean, J.1    Ghemawat, S.2
  • 14
    • 33646833573 scopus 로고    scopus 로고
    • Monitoring MPI running nodes status for load balance
    • Proceedings of the 4th International Conference on Grid and Cooperative Computing. Springer, Berlin
    • DENG, Q., WANG, X., AND ZANG, D. 2005. Monitoring MPI running nodes status for load balance. In Proceedings of the 4th International Conference on Grid and Cooperative Computing. Lecture Notes in Computer Science, vol.3795, Springer, Berlin, 467-473.
    • (2005) Lecture Notes in Computer Science , vol.3795 , pp. 467-473
    • Deng, Q.1    Wang, X.2    Zang, D.3
  • 16
    • 84865097696 scopus 로고
    • Adaptive load sharing in homogeneous distributed systems
    • EAGER, D. L., LAZOWSKA, E. D., AND ZAHORJAN, J. 1986. Adaptive load sharing in homogeneous distributed systems. IEEE Trans. Softw. Engin. 12, 5, 662-675.
    • (1986) IEEE Trans. Softw. Engin. , vol.12 , Issue.5 , pp. 662-675
    • Eager, D.L.1    Lazowska, E.D.2    Zahorjan, J.3
  • 18
    • 0036499076 scopus 로고    scopus 로고
    • Opiom: Off-processor i/o with myrinet
    • GEOFFRAY, P. 2002. Opiom: off-processor i/o with myrinet. Future Gener. Comput. Syst. 18, 4, 491-499.
    • (2002) Future Gener. Comput. Syst. , vol.18 , Issue.4 , pp. 491-499
    • Geoffray, P.1
  • 21
    • 0033157563 scopus 로고    scopus 로고
    • Improved strategies for dynamic load balancing
    • HUI, C.-C. AND CHANSON, S. T. 1999. Improved strategies for dynamic load balancing. IEEE Concurrency 7, 3, 58-67.
    • (1999) IEEE Concurrency , vol.7 , Issue.3 , pp. 58-67
    • Hui, C.-C.1    Chanson, S.T.2
  • 23
    • 0038137109 scopus 로고    scopus 로고
    • Opportunity cost algorithms for reduction of i/o and interprocess communication overhead in a computing cluster
    • KEREN, A. AND BARAK, A. 2003. Opportunity cost algorithms for reduction of i/o and interprocess communication overhead in a computing cluster. IEEE Trans. Parall. Distrib. Syst. 14, 1, 39-50.
    • (2003) IEEE Trans. Parall. Distrib. Syst. , vol.14 , Issue.1 , pp. 39-50
    • Keren, A.1    Barak, A.2
  • 24
    • 0022806595 scopus 로고
    • Synchronized disk interleaving
    • KIM, M. Y. 1986. Synchronized disk interleaving. IEEE Trans. Comput. 35, 11, 978-988.
    • (1986) IEEE Trans. Comput. , vol.35 , Issue.11 , pp. 978-988
    • Kim, M.Y.1
  • 25
    • 0028734944 scopus 로고
    • Dynamic file-access characteristics of a production parallel scientific workload
    • IEEE Computer Society Press, Los Alamitos, CA
    • KOTZ, D. AND NIEUWEJAAR, N. 1994. Dynamic file-access characteristics of a production parallel scientific workload. In Proceedings of the Conference on Supercomputing (Supercomputing'94). IEEE Computer Society Press, Los Alamitos, CA, 640-649.
    • (1994) Proceedings of the Conference on Supercomputing (Supercomputing'94) , pp. 640-649
    • Kotz, D.1    Nieuwejaar, N.2
  • 27
    • 0033878669 scopus 로고    scopus 로고
    • File assignment in parallel i/o systems with minimal variance of service time
    • LEE, L.-W., SCHEUERMANN, P., AND VINGRALEK, R. 2000. File assignment in parallel i/o systems with minimal variance of service time. IEEE Trans. Comput. 49, 2, 127-140.
    • (2000) IEEE Trans. Comput. , vol.49 , Issue.2 , pp. 127-140
    • Lee, L.-W.1    Scheuermann, P.2    Vingralek, R.3
  • 29
    • 0028732782 scopus 로고
    • Dynamic i/o characterization of i/o intensive scientific applications
    • IEEE Computer Society Press, Los Alamitos, CA
    • PASQUALE, B. K. AND POLYZOS, G. C. 1994. Dynamic i/o characterization of i/o intensive scientific applications. In Proceedings of the Conference on Supercomputing (Supercomputing'94). IEEE Computer Society Press, Los Alamitos, CA, 660-669.
    • (1994) Proceedings of the Conference on Supercomputing (Supercomputing'94) , pp. 660-669
    • Pasquale, B.K.1    Polyzos, G.C.2
  • 30
    • 36049018911 scopus 로고    scopus 로고
    • Performance comparisons of load balancing algorithms for i/o-intensive workloads on clusters
    • QIN, X. 2008. Performance comparisons of load balancing algorithms for i/o-intensive workloads on clusters. J. Netw. Comput. Appl. 31, 1, 32-46.
    • (2008) J. Netw. Comput. Appl. , vol.31 , Issue.1 , pp. 32-46
    • Qin, X.1
  • 37
    • 0000182341 scopus 로고
    • Configurations of the solar wind flow and magnetic field around the planets with no magnetic field: Calculation by a new mhd
    • TANAKA, T. 1993. Configurations of the solar wind flow and magnetic field around the planets with no magnetic field: Calculation by a new mhd. Geophys. Res., 17251-17262.
    • (1993) Geophys. Res. , pp. 17251-17262
    • Tanaka, T.1
  • 38
    • 0008947033 scopus 로고    scopus 로고
    • Requirements of i/o systems for parallel machines: An application-driven study
    • College Park, MD
    • UYSAL, M., ACHARYA, A., AND SALTZ, J. 1997. Requirements of i/o systems for parallel machines: an application-driven study. Tech. rep., College Park, MD.
    • (1997) Tech. Rep.
    • Uysal, M.1    Acharya, A.2    Saltz, J.3
  • 39
    • 0033317118 scopus 로고    scopus 로고
    • Tight bounds for prefetching and buffer management algorithms for parallel i/o systems
    • VARMAN, P. J. AND VERMA, R. M. 1999. Tight bounds for prefetching and buffer management algorithms for parallel i/o systems. IEEE Trans. Parall. Distrib. Syst. 10, 12, 1262-1275.
    • (1999) IEEE Trans. Parall. Distrib. Syst. , vol.10 , Issue.12 , pp. 1262-1275
    • Varman, P.J.1    Verma, R.M.2
  • 46
    • 30644459480 scopus 로고    scopus 로고
    • A case study of parallel i/o for biological sequence search on linux clusters
    • ZHU, Y., JIANG, H., QIN, X., AND SWANSON, D. 2004. A case study of parallel i/o for biological sequence search on linux clusters. Int. J. High Perform. Comput. Netw. 1, 4, 214-222.
    • (2004) Int. J. High Perform. Comput. Netw. , vol.1 , Issue.4 , pp. 214-222
    • Zhu, Y.1    Jiang, H.2    Qin, X.3    Swanson, D.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.