메뉴 건너뛰기




Volumn 42, Issue 3, 2006, Pages 1628-1640

A cost-effective critical path approach for service priority selections in grid computing economy

Author keywords

Computational complexity; Critical path method (CPM); Grid computing; Heuristic algorithm; Internet resources pricing; Time cost tradeoff

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; COST EFFECTIVENESS; CRITICAL PATH ANALYSIS; JOB ANALYSIS; PROBLEM SOLVING; USER INTERFACES;

EID: 33750432504     PISSN: 01679236     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dss.2006.02.010     Document Type: Article
Times cited : (20)

References (25)
  • 1
    • 0036788946 scopus 로고    scopus 로고
    • A computational economy for grid computing and its implementation in the Nimrod-G resource broker
    • Abramson D., Buyya R., and Giddy J. A computational economy for grid computing and its implementation in the Nimrod-G resource broker. Future Generation Computer Systems 18 8 (2002) 1061-1074
    • (2002) Future Generation Computer Systems , vol.18 , Issue.8 , pp. 1061-1074
    • Abramson, D.1    Buyya, R.2    Giddy, J.3
  • 2
    • 0037297832 scopus 로고    scopus 로고
    • Call admission control in generalized processor sharing schedulers with tight deterministic delay bounds
    • Barta P., Németh F., Szabó R., and Bíró J. Call admission control in generalized processor sharing schedulers with tight deterministic delay bounds. Computer Communications 26 2 (2003) 65-78
    • (2003) Computer Communications , vol.26 , Issue.2 , pp. 65-78
    • Barta, P.1    Németh, F.2    Szabó, R.3    Bíró, J.4
  • 4
    • 0030125172 scopus 로고    scopus 로고
    • Adding service discrimination to the internet
    • Clark D.D. Adding service discrimination to the internet. Telecommunication Policy 20 (1996) 169-181
    • (1996) Telecommunication Policy , vol.20 , pp. 169-181
    • Clark, D.D.1
  • 5
    • 0014928334 scopus 로고
    • Decision CPM: network reduction and solution
    • Crowston W.B. Decision CPM: network reduction and solution. Operational Research Quarterly 21 (1970) 435-452
    • (1970) Operational Research Quarterly , vol.21 , pp. 435-452
    • Crowston, W.B.1
  • 7
    • 0031102411 scopus 로고    scopus 로고
    • Complexity of the discrete time-cost tradeoff problem for project networks
    • De P., Dunne E.J., Ghosh J.B., and Wells C.E. Complexity of the discrete time-cost tradeoff problem for project networks. Operations Research 45 (1997) 302-306
    • (1997) Operations Research , vol.45 , pp. 302-306
    • De, P.1    Dunne, E.J.2    Ghosh, J.B.3    Wells, C.E.4
  • 8
    • 0003312169 scopus 로고    scopus 로고
    • Promoting the use of end-to-end congestion control in the internet
    • Floyd S., and Fall K. Promoting the use of end-to-end congestion control in the internet. IEEE/ACM Transactions on Networking (1998)
    • (1998) IEEE/ACM Transactions on Networking
    • Floyd, S.1    Fall, K.2
  • 12
    • 0032207226 scopus 로고    scopus 로고
    • Managing computing resources in intranets: an electronic commerce perspective
    • Gupta A., Stahl D.O., and Whinston A.B. Managing computing resources in intranets: an electronic commerce perspective. Decision Support Systems 24 (1998) 55-69
    • (1998) Decision Support Systems , vol.24 , pp. 55-69
    • Gupta, A.1    Stahl, D.O.2    Whinston, A.B.3
  • 14
    • 0005764899 scopus 로고
    • An implicit enumeration algorithm for the time/cost tradeoff problem in project network analysis
    • Harvey R.T., and Patterson J.H. An implicit enumeration algorithm for the time/cost tradeoff problem in project network analysis. Foundations of Control Engineering 4 (1979) 107-117
    • (1979) Foundations of Control Engineering , vol.4 , pp. 107-117
    • Harvey, R.T.1    Patterson, J.H.2
  • 17
    • 33750444554 scopus 로고    scopus 로고
    • http://cedar.intel.com/cgi-bin/ids.dll/content/content.jsp?cntKey=Generi c+Editorial%3a%3apentium4_terrorism&cntType=IDS_EDITORIAL&catCod e=BYM
    • Kantor J. Winning the Battle for ROI in the War on Terrorism (2003). http://cedar.intel.com/cgi-bin/ids.dll/content/content.jsp?cntKey=Generi c+Editorial%3a%3apentium4_terrorism&cntType=IDS_EDITORIAL&catCode=BYM http://cedar.intel.com/cgi-bin/ids.dll/content/content.jsp?cntKey=Generi c+Editorial%3a%3apentium4_terrorism&cntType=IDS_EDITORIAL&catCod e=BYM
    • (2003) Winning the Battle for ROI in the War on Terrorism
    • Kantor, J.1
  • 19
    • 0039915911 scopus 로고    scopus 로고
    • Exploring traffic pricing for the virtual private network
    • Charlotte, North Carolina
    • Lin Z., Ow P.S., Stahl D.O., and Whinston A.B. Exploring traffic pricing for the virtual private network. The Proceedings of WITS'99 (December 11-12 1999) Charlotte, North Carolina
    • (1999) The Proceedings of WITS'99
    • Lin, Z.1    Ow, P.S.2    Stahl, D.O.3    Whinston, A.B.4
  • 20
    • 33750491054 scopus 로고    scopus 로고
    • A traffic-pricing model for the packet-switching network with prioritized round-robin queueing
    • San Antonio
    • Lin Z., Stahl D.O., and Whinston A.B. A traffic-pricing model for the packet-switching network with prioritized round-robin queueing. The 5th INFORMS-CIST (November 5 2000) San Antonio
    • (2000) The 5th INFORMS-CIST
    • Lin, Z.1    Stahl, D.O.2    Whinston, A.B.3
  • 21
    • 33750467918 scopus 로고    scopus 로고
    • Pricing web services for optimizing resource allocation - an implementation scheme
    • Lin Z., Zhao H., and Ramanathan S. Pricing web services for optimizing resource allocation - an implementation scheme. Web2003, Seattle, WA (December 13-14 2003)
    • (2003) Web2003, Seattle, WA
    • Lin, Z.1    Zhao, H.2    Ramanathan, S.3
  • 22
    • 0038909956 scopus 로고
    • Extending CPM for multiform project time-cost curves
    • Journal of the Construction Division
    • Meyer W.L., and Shaffer L.R. Extending CPM for multiform project time-cost curves. Journal of the Construction Division. Proceedings of the ASCE vol. 91 (1965) 45-65
    • (1965) Proceedings of the ASCE , vol.91 , pp. 45-65
    • Meyer, W.L.1    Shaffer, L.R.2
  • 23
    • 0037393815 scopus 로고    scopus 로고
    • The great grid revolution
    • Mielke D. The great grid revolution. Telecommunications 37 5 (2003) 15-17
    • (2003) Telecommunications , vol.37 , Issue.5 , pp. 15-17
    • Mielke, D.1
  • 24
    • 0032208139 scopus 로고    scopus 로고
    • Approximation algorithms for the discrete time-cost tradeoff problem
    • Skutella M. Approximation algorithms for the discrete time-cost tradeoff problem. Mathematics of Operations Research 23 4 (Nov. 1998) 909-929
    • (1998) Mathematics of Operations Research , vol.23 , Issue.4 , pp. 909-929
    • Skutella, M.1


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