메뉴 건너뛰기




Volumn 24, Issue 5, 2013, Pages 926-937

Heterogeneous resource allocation under degree constraints

Author keywords

approximation algorithms; bin packing; cloud computing; divisible scheduling; Online computation; resource augmentation

Indexed keywords

ALLOCATION PROBLEMS; BIN PACKING; EXTENSIVE SIMULATIONS; HETEROGENEOUS RESOURCES; INDEPENDENT TASKS SCHEDULING; ONLINE COMPUTATIONS; OPTIMAL THROUGHPUTS; RESOURCE AUGMENTATION;

EID: 84875712067     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2012.175     Document Type: Article
Times cited : (32)

References (31)
  • 3
    • 68249129760 scopus 로고    scopus 로고
    • Above the clouds: A berkeley view of cloud computing
    • EECS Dept., Univ. of California, Berkeley
    • M. Armbrust et al., "Above the Clouds: A Berkeley View of Cloud Computing," Technical Report UCB/EECS-2009-28, EECS Dept., Univ. of California, Berkeley, 2009.
    • (2009) Technical Report UCB/EECS-2009-28
    • Armbrust, M.1
  • 10
    • 0000212952 scopus 로고    scopus 로고
    • Asymptotically optimal algorithms for job shop scheduling and packet routing
    • D. Bertsimas and D. Gamarnik, "Asymptotically Optimal Algorithm for Job Shop Scheduling and Packet Routing," J. Algorithms, vol. 33, no. 2, pp. 296-318, 1999. (Pubitemid 129607238)
    • (1999) Journal of Algorithms , vol.33 , Issue.2 , pp. 296-318
    • Bertsimas, D.1    Gamarnik, D.2
  • 14
    • 33845304712 scopus 로고    scopus 로고
    • Parallelism versus memory allocation in pipelined router forwarding engines
    • DOI 10.1007/s00224-006-1249-3
    • F. Chung, R. Graham, J. Mao, and G. Varghese, "Parallelism Versus Memory Allocation in Pipelined Router Forwarding Engines," Theory of Computing Systems, vol. 39, no. 6, pp. 829-849, 2006. (Pubitemid 44878428)
    • (2006) Theory of Computing Systems , vol.39 , Issue.6 , pp. 829-849
    • Chung, F.1    Graham, R.2    Mao, J.3    Varghese, G.4
  • 16
    • 38149101783 scopus 로고    scopus 로고
    • Improved results for a memory allocation problem
    • Frank K. H. A. Dehne, Jörg-Rü diger Sack, and Norbert Zeh, eds
    • L. Epstein and R. van Stee, "Improved Results for a Memory Allocation Problem," Proc. Workshop Algorithms and Data Structures (WADS), Frank K. H. A. Dehne, Jörg-Rü diger Sack, and Norbert Zeh, eds., pp. 362-373, 2007.
    • (2007) Proc. Workshop Algorithms and Data Structures (WADS) , pp. 362-373
    • Epstein, L.1    Van Stee, R.2
  • 20
    • 33746568331 scopus 로고    scopus 로고
    • Chapter 9. Queueing Disciplines for Bandwidth Management
    • B. Hubert, "Linux Advanced Routing Traffic Control. Chapter 9. Queueing Disciplines for Bandwidth Management," http://lartc.org/lartc.pdf, 2002.
    • (2002) Linux Advanced Routing Traffic Control
    • Hubert, B.1
  • 21
    • 0000696568 scopus 로고    scopus 로고
    • Speed is as powerful as clairvoyance
    • B. Kalyanasundaram and K. Pruhs, "Speed Is as Powerful as Clairvoyance," J. ACM, vol. 47, no. 4, pp. 617-643, 2000.
    • (2000) J ACM , vol.47 , Issue.4 , pp. 617-643
    • Kalyanasundaram, B.1    Pruhs, K.2
  • 23
    • 4644249937 scopus 로고    scopus 로고
    • Folding@ home and genome@ home: Using distributed computing to tackle previously intractable problems in Computational Biology
    • S.M. Larson, C.D. Snow, M. Shirts, and V.S. Pande, "Folding@ Home and Genome@ Home: Using Distributed Computing to Tackle Previously Intractable Problems in Computational Biology," Proc. Computational Genomics, 2002.
    • (2002) Proc. Computational Genomics
    • Larson, S.M.1    Snow, C.D.2    Shirts, M.3    Pande, V.S.4
  • 24
    • 0042209421 scopus 로고    scopus 로고
    • Optimal time-critical scheduling via resource augmentation
    • C.A. Phillips, "Optimal Time-Critical Scheduling via Resource Augmentation," Algorithmica, vol. 32, no. 2, pp. 163-200, 2008.
    • (2008) Algorithmica , vol.32 , Issue.2 , pp. 163-200
    • Phillips, C.A.1
  • 25
    • 35048856680 scopus 로고    scopus 로고
    • Understanding the behavior and performance of non-blocking communications in mpI
    • T. Saif and M. Parashar, "Understanding the Behavior and Performance of Non-Blocking Communications in MPI," Proc. European Conf. Parallel Processing, pp. 173-182, 2004.
    • (2004) Proc. European Conf. Parallel Processing , pp. 173-182
    • Saif, T.1    Parashar, M.2
  • 26
    • 0141922825 scopus 로고    scopus 로고
    • Multiprocessor scheduling with machine allotment and parallelism constraints
    • H. Shachnai and T. Tamir, "Multiprocessor Scheduling with Machine Allotment and Parallelism Constraints," Algorithmica, vol. 32, no. 4, pp. 651-678, 2002.
    • (2002) Algorithmica , vol.32 , Issue.4 , pp. 651-678
    • Shachnai, H.1    Tamir, T.2
  • 27
    • 40849135778 scopus 로고    scopus 로고
    • Approximation schemes for packing with item fragmentation
    • H. Shachnai, T. Tamir, and O. Yehezkely, "Approximation Schemes for Packing with Item Fragmentation," Theory Computing Systems, vol. 43, no. 1, pp. 81-98, 2008.
    • (2008) Theory Computing Systems , vol.43 , Issue.1 , pp. 81-98
    • Shachnai, H.1    Tamir, T.2    Yehezkely, O.3
  • 29
    • 84875722949 scopus 로고    scopus 로고
    • Vmware, http://www.vmware.com/virtualization/, 2012.
    • (2012)
  • 30
    • 84875708441 scopus 로고    scopus 로고
    • Xen, http://www.xen.org/, 2012.
    • (2012)
  • 31
    • 78649302229 scopus 로고    scopus 로고
    • Cloud computing: State-ofthe-art and research challenges
    • Q. Zhang, L. Cheng, and R. Boutaba, "Cloud Computing: State-ofthe-Art and Research Challenges," J. Internet Services and Applications, vol. 1, no. 1, pp. 7-18, 2010.
    • (2010) J. Internet Services and Applications , vol.1 , Issue.1 , pp. 7-18
    • Zhang, Q.1    Cheng, L.2    Boutaba, R.3


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