SCOPUS 정보 검색 플랫폼

Proceedings - IEEE INFOCOM

Volumn , Issue , 2012, Pages 2871-2875

To migrate or to wait: Bandwidth-latency tradeoff in opportunistic scheduling of parallel tasks

(5) He, Ting a Chen, Shiyao b Kim, Hyoil c Tong, Lang b Lee, Kang Won a

a IBM T J WATSON RESEARCH CENTER (United States)

b Department of Molecular Biology and Genetics (United States)

c Ulsan National Institute of Science and Technology (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

BURSTINESS; LATENCY COSTS; MARKOV DECISION PROCESSES; MARKOVIAN; ONLINE SCHEDULING; OPPORTUNISTIC SCHEDULING; OPTIMAL SCHEDULING; PARALLEL TASK; RESOURCE AVAILABILITY; TRACE DRIVEN SIMULATION;

BANDWIDTH; COMMERCE; COSTS; MARKOV PROCESSES; OPTIMIZATION; SCHEDULING;

WEBSITES;

EID: 84861621114 PISSN: 0743166X EISSN: None Source Type: Conference Proceeding
DOI: 10.1109/INFCOM.2012.6195718 Document Type: Conference Paper

Times cited : (6)

References (10)

1
- 70350627338
- Pregel: A System for Large-Scale Graph Processing
- G. Malewicz, M. Austem, A. Bik, J. Dehnert, I. Horn, N. Leiser, and G. Czajkowski, "Pregel: A System for Large-Scale Graph Processing," in PODC,2009.
- (2009) PODC
- Malewicz, G.¹ Austem, M.² Bik, A.³ Dehnert, J.⁴ Horn, I.⁵ Leiser, N.⁶ Czajkowski, G.⁷

2
- 84861620353
- "Introduction to Parallel Programming and MapReduce," http://code.google.comJeduJparallel/mapreduce-tutorial.html.
- Introduction to Parallel Programming and MapReduce

3
- 12444278206
- Unobtrusiveness and Efficiency in Idle Cycle Stealing for PC Grids
- K. D. Ryu and J. K. Hollingsworth, "Unobtrusiveness and Efficiency in Idle Cycle Stealing for PC Grids," in IPDPS, 2004.
- (2004) IPDPS
- Ryu, K.D.¹ Hollingsworth, J.K.²

4
- 80052163814
- Enabling Resource Sharnig between Transactional and Batch Workloads Using Dynamic Application Placement
- D. Carrera, M. Steinder, I. Whalley, J. Torres, and E. Ayguade, "Enabling Resource Sharnig between Transactional and Batch Workloads Using Dynamic Application Placement," in MIDDLEWARE, 2008.
- (2008) MIDDLEWARE
- Carrera, D.¹ Steinder, M.² Whalley, I.³ Torres, J.⁴ Ayguade, E.⁵

5
- 77953973140
- Varying Bandwidth Resource Allocation Problem with Bag Constraints
- V. T. Chakaravarthy, V Pandit, Y. Sabharwal, and D. P. Seetharam, "Varying Bandwidth Resource Allocation Problem with Bag Constraints," in IPDPS, 2010.
- (2010) IPDPS
- Chakaravarthy, V.T.¹ Pandit, V.² Sabharwal, Y.³ Seetharam, D.P.⁴

6
- 80053560233
- Discovering Statistical Models of Availability in Large Distributed Systems: An Empirical Study of SETI@home
- B. Favadi, D. Kondo, J.-M. Vincent, and D. P. Anderson, "Discovering Statistical Models of Availability in Large Distributed Systems: An Empirical Study of SETI@home," Trans. PDS,2011.
- (2011) Trans. PDS
- Favadi, B.¹ Kondo, D.² Vincent, J.-M.³ Anderson, D.P.⁴

7
- 10944236938
- A Survey on the Bandit Problem with Switching Costs
- T. Jun, "A Survey on the Bandit Problem with Switching Costs," De Economist, 2004.
- (2004) De Economist
- Jun, T.¹

8
- 34047200608
- preprint
- K. D. Glazebrook and D. Ruiz-Hemandez, "A Restless Bandit Approach to Stochastic Scheduling Problems with Switching Costs," 2005, preprint.
- (2005) A Restless Bandit Approach to Stochastic Scheduling Problems with Switching Costs
- Glazebrook, K.D.¹ Ruiz-Hemandez, D.²

9
- 84866755360
- Tech. Rep.
- T. He, S. Chen, H. Kim, K.-W. Lee, and L. Tong, "Bandwidth-Latency Tradeoff in Opportunistic Task Scheduling: Supporting Materials," IBM, Tech. Rep., 2011, http://researcher.ibm.comJfiles/us-the/rc071101.pdf.
- (2011) Bandwidth-Latency Tradeoff in Opportunistic Task Scheduling: Supporting Materials
- He, T.¹ Chen, S.² Kim, H.³ Lee, K.-W.⁴ Tong, L.⁵

10
- 0003998452
- Wiley
- M. L. Puterman, Markov Decision Processes. Wiley, 1994.
- (1994) Markov Decision Processes
- Puterman, M.L.¹

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