메뉴 건너뛰기




Volumn 30, Issue 3, 2007, Pages 499-515

Adjusted fair scheduling and non-linear workload prediction for QoS guarantees in grid computing

Author keywords

Fair grid scheduling; Grid enabled networking middleware; Non linear workload modeling; QoS requirements; Workload prediction

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; COMPUTER SOFTWARE; MIDDLEWARE; NONLINEAR SYSTEMS; QUALITY OF SERVICE;

EID: 33846169701     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comcom.2005.11.013     Document Type: Article
Times cited : (41)

References (33)
  • 2
    • 0012196264 scopus 로고    scopus 로고
    • Information power grid: the new frontier in parallel computing?
    • Leinberger W., and Kumar V. Information power grid: the new frontier in parallel computing?. IEEE Concurrency 7 4 (1999) 75-84
    • (1999) IEEE Concurrency , vol.7 , Issue.4 , pp. 75-84
    • Leinberger, W.1    Kumar, V.2
  • 4
    • 33846144224 scopus 로고    scopus 로고
    • Scheduling Working Group of the Grid Forum, Document: 10.5, September 2001.
  • 5
    • 4944252587 scopus 로고    scopus 로고
    • Online prediction of the running time of tasks
    • Dinda P. Online prediction of the running time of tasks. Cluster Computing 5 3 (2002)
    • (2002) Cluster Computing , vol.5 , Issue.3
    • Dinda, P.1
  • 8
    • 0003794137 scopus 로고
    • Prentice-Hall, Englewood Cliffs NJ The section on max-min fairness starts on p. 524
    • Bertsekas D., and Gallager R. Data Networks (1992), Prentice-Hall, Englewood Cliffs NJ The section on max-min fairness starts on p. 524
    • (1992) Data Networks
    • Bertsekas, D.1    Gallager, R.2
  • 10
    • 0003370391 scopus 로고    scopus 로고
    • High throughput computing with condor
    • Basney J., Livny M., and Tannenbaum T. High throughput computing with condor. HPCU news 1 2 (1997)
    • (1997) HPCU news , vol.1 , Issue.2
    • Basney, J.1    Livny, M.2    Tannenbaum, T.3
  • 15
    • 10044223342 scopus 로고    scopus 로고
    • S. Kim, J.B. Weissman, A genetic algorithm based approach for scheduling decomposable data grid applications, in: International Conference on Parallel Processing (ICPP'04), Montreal, Quebec, Canada, 2004, pp. 406-413.
  • 16
    • 12444288518 scopus 로고    scopus 로고
    • Keqin Li, Experimental performance evaluation of job scheduling and processor allocation algorithms for grid computing on metacomputers, in: Proceeding of the IEEE 18th International Parallel and Distributed processing Symposium (IPDPS), Santa Fe, New Mexico, 2004, pp. 170-177.
  • 17
    • 28844434726 scopus 로고    scopus 로고
    • Ten actions when grid scheduling
    • Nabrzyski J., Schopf J.M., and Weglarz J. (Eds), Kluwer, Dordrecht (Chapter 2)
    • Schopf J.M. Ten actions when grid scheduling. In: Nabrzyski J., Schopf J.M., and Weglarz J. (Eds). Grid Resource Management: State of the Art and Future Trends (2003), Kluwer, Dordrecht (Chapter 2)
    • (2003) Grid Resource Management: State of the Art and Future Trends
    • Schopf, J.M.1
  • 18
    • 0033316015 scopus 로고    scopus 로고
    • Statistical prediction of task execution times through analytic benchmarking for scheduling in a heterogeneous environment
    • Iverson M.A., Ozguner F., and Potter L. Statistical prediction of task execution times through analytic benchmarking for scheduling in a heterogeneous environment. IEEE Transactions on Computers 48 12 (1999) 1374-1379
    • (1999) IEEE Transactions on Computers , vol.48 , Issue.12 , pp. 1374-1379
    • Iverson, M.A.1    Ozguner, F.2    Potter, L.3
  • 20
    • 85058033478 scopus 로고    scopus 로고
    • J. Yang, A. Khokhar, S. Sheikh, and A. Ghafoor, Estimating Execution Time for Parallel Tasks in Heterogeneous Processing (HP) Environment, in: Proceedings of the Heterogeneous Computing Workshop, 1994, pp. 23-28.
  • 21
    • 0027612043 scopus 로고
    • A generalized processor sharing approach to flow control in integrated services networks: the single-node case
    • Parekh A.K., and Gallager R.G. A generalized processor sharing approach to flow control in integrated services networks: the single-node case. IEEE/ACM Transactions on Networking 1 3 (1993) 344-357
    • (1993) IEEE/ACM Transactions on Networking , vol.1 , Issue.3 , pp. 344-357
    • Parekh, A.K.1    Gallager, R.G.2
  • 22
    • 33846174678 scopus 로고    scopus 로고
    • A. Demers, S. Keshav, S. Shenker, Design and analysis of a fair queuing algorithm, in: Proceedings of the ACMSIGCOMM, Austin, 1989.
  • 23
    • 84949948270 scopus 로고    scopus 로고
    • F. Vraalsen, R.A. Aydt, C.L. Mendes, D.A. Reed, Performance contracts: predicting and monitoring grid application behavior, in: Proceedings of the 2nd International Workshop on Grid Computing (GRID), vol. 2242, Denver, Colorado, Nov. 2001, pp. 154-165.
  • 25
    • 0030871109 scopus 로고    scopus 로고
    • T. Stricker, T. Cross, Global Address Space, Non-Uniform Bandwidth: A Memory System Performance Characterization of Parallel Systems. in: Proceedings of IEEE Symposium on High-Performance Computer Architecture (HPCA '97), February 1997.
  • 29
    • 0001160588 scopus 로고
    • What size net gives valid generalization?
    • Baum E.B., and Haussler D. What size net gives valid generalization?. Neural Computation 1 1 (1989) 151-160
    • (1989) Neural Computation , vol.1 , Issue.1 , pp. 151-160
    • Baum, E.B.1    Haussler, D.2
  • 32
    • 33846136119 scopus 로고    scopus 로고
    • IST-2001-33240, Grid Resources for Industrial Applications (GRIA), European Union program of Information Societies Technology.


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