SCOPUS 정보 검색 플랫폼

Volumn , Issue , 2003, Pages 97-98

Data migration to minimize the average completion time

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; OPTIMIZATION; POLYNOMIALS; SCHEDULING;

APPROXIMATION ALGORITHM; CHROMATIC INDEX PROBLEM; DATA MIGRATION;

DATA STORAGE EQUIPMENT;

EID: 0038078083 PISSN: None EISSN: None Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper

Times cited : (14)

References (10)

1
- 0000236642
- On chromatic sums and distributed resource allocation
- A. Bar-Noy, M. Bellare, M. M. Halldorsson, H. Shachnai, and T. Tamir, On chromatic sums and distributed resource allocation, Information and Computation, Vol.140, pp. 183-202, 1998.
- (1998) Information and Computation , vol.140 , pp. 183-202
- Bar-Noy, A.¹ Bellare, M.² Halldorsson, M.M.³ Shachnai, H.⁴ Tamir, T.⁵

2
- 0022106463
- Scheduling file transfers
- E. G. Coffman, M. R. Garey, D. S. Johnson, and A. S. Lapaugh, Scheduling file transfers, SIAM J. on Computing, 14(3):744-780, 1985.
- (1985) SIAM J. on Computing , vol.14 , Issue.3 , pp. 744-780
- Coffman, E.G.¹ Garey, M.R.² Johnson, D.S.³ Lapaugh, A.S.⁴

3
- 84986490658
- Edge-coloring of multigraphs: Recoloring technique
- M.K. Goldberg, Edge-coloring of multigraphs:recoloring technique, J. Graph Theory, 8:121-137, 1984.
- (1984) J. Graph Theory , vol.8 , pp. 121-137
- Goldberg, M.K.¹

4
- 0033879195
- Approximation algorithms for data placement on parallel disks
- L. Golubchik, S. Khanna, S. Khuller, R. Thurimella and A. Zhu. Approximation algorithms for data placement on parallel disks, 11th SODA, pp.223-232, 2000.
- (2000) 11th SODA , pp. 223-232
- Golubchik, L.¹ Khanna, S.² Khuller, S.³ Thurimella, R.⁴ Zhu, A.⁵

5
- 0038521993
- On algorithms for efficient data migration
- J. Hall, J. Hartline, A. Karlin, J. Saia and J. Wilkes. On algorithms for efficient data migration, 12th SODA. pp. 620-629, 2001.
- (2001) 12th SODA , pp. 620-629
- Hall, J.¹ Hartline, J.² Karlin, A.³ Saia, J.⁴ Wilkes, J.⁵

6
- 0031207982
- Scheduling to minimize average completion time: Off-line and on-line algorithms
- L.A. Hall, A. S. Schulz, D. B. Shmoys, and J. Wein. Scheduling to minimize average completion time: off-line and on-line algorithms, Mathematics of Operations Research 22, pp. 513-544, 1997.
- (1997) Mathematics of Operations Research , vol.22 , pp. 513-544
- Hall, L.A.¹ Schulz, A.S.² Shmoys, D.B.³ Wein, J.⁴

7
- 84923106699
- Minimizing average completion of dedicated tasks and partially ordered sets
- M. M. Halldorsson, G. Kortsarz, H. Shachani, Minimizing average completion of dedicated tasks and partially ordered sets, 4th Approx, pp. 114-126, 2001.
- (2001) 4th Approx , pp. 114-126
- Halldorsson, M.M.¹ Kortsarz, G.² Shachani, H.³

8
- 38249042614
- A better than "Best Possible" algorithm to edge color multigraphs
- D. S. Hochbaum, T. Nishizeki, and D. B. Symoys. A better than "Best Possible" algorithm to edge color multigraphs, J. of Algorithm, 7:79-104, 1986.
- (1986) J. of Algorithm , vol.7 , pp. 79-104
- Hochbaum, D.S.¹ Nishizeki, T.² Shmoys, D.B.³

9
- 24244432570
- Data migration to minimize the average completion time
- Y. Kim, Data migration to minimize the average completion time, http://www.cs.umd.edu/~ykim/sO3f.ps.
- Kim, Y.¹

10
- 0001267667
- Structure of a simple scheduling polyhedron
- M. Queyranne, Structure of a simple scheduling polyhedron, Math. Programming 58, pp. 263-285, 1993.
- (1993) Math. Programming , vol.58 , pp. 263-285
- Queyranne, M.¹

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