SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 620-629

On algorithms for efficient data migration

(5) Hall, Joseph a Hartline, Jason a Karlin, Anna R a Saia, Jared a Wilkes, John b

a University of Washington (United States)

b HEWLETT PACKARD LABORATORIES (United States)

Author keywords

Algorithms; Theory; Verification

Indexed keywords

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

Times cited : (73)

References (9)

1
- 0043001953
- Using attribute-managed storage to achieve QoS
- Presented at, Columbia Univ, New York, June
- E. Borowsky, R. Golding, A. Merchant, L. Schreier, E.Shriver, M.Spasojevic, and J. Wilkes. Using attribute-managed storage to achieve QoS. In Presented at 5th Intl. Workshop on Quality off Service, Columbia Univ., New York, June 1997.
- (1997) 5th Intl. Workshop on Quality off Service
- Borowsky, E.¹ Golding, R.² Merchant, A.³ Schreier, L.⁴ Shriver, E.⁵ Spasojevic, M.⁶ Wilkes, J.⁷

2
- 0025388455
- Dynamic file migration in distributed computer systems
- Feb, doi〉10.1145/75577.75583
- Bezalel Gavish , Olivia R. Liu Sheng, Dynamic file migration in distributed computer systems, Communications of the ACM, v.33 n.2, p.177-189, Feb. 1990 [doi〉10.1145/75577.75583]
- (1990) Communications of the ACM , vol.33 , Issue.2 , pp. 177-189
- Gavish, B.¹ Liu Sheng, O.R.²

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
- January 09-11, San Francisco, California, United States
- L. Golubchik , S. Khanna , S. Khuller , R. Thurimella , A. Zhu, Approximation algorithms for data placement on parallel disks, Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, p.223-232, January 09-11, 2000, San Francisco, California, United States
- (2000) Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms , pp. 223-232
- Golubchik, L.¹ Khanna, S.² Khuller, S.³ Thurimella, R.⁴ Zhu, A.⁵

5
- 38249042614
- Dorit S Hochbaum , Takao Nishizeki , David B Shmoys, A better than best possible algorithm to edge color multigraphs, Journal of Algorithms, v.7 n.1, p.79-104, March 1986 [doi〉10.1016/0196-6774(86)90039- 8]
- Dorit S Hochbaum , Takao Nishizeki , David B Shmoys, A better than "best possible" algorithm to edge color multigraphs, Journal of Algorithms, v.7 n.1, p.79-104, March 1986 [doi〉10.1016/0196-6774(86)90039- 8]

6
- 0000429528
- The NP-completeness of edge coloring
- I. J. Hoyer. The NP-completeness of edge coloring. SIAM J. Comput., 10:718-720, 1981.
- (1981) SIAM J. Comput , vol.10 , pp. 718-720
- Hoyer, I.J.¹

7
- 85171835916
- A theorem on colouring lines of a network
- C. E. Shannon. A theorem on colouring lines of a network. J. Math. Phys., 28:148-151, 1949.
- (1949) J. Math. Phys , vol.28 , pp. 148-151
- Shannon, C.E.¹

8
- 0002935868
- On an estimate of the chromatic class of a p-graph
- V. G. Vizing. On an estimate of the chromatic class of a p-graph. Diskret. Anal., 3:25-30, 1964.
- (1964) Diskret. Anal , vol.3 , pp. 25-30
- Vizing, V.G.¹

9
- 0024662286
- The placement optimization program: A practical solution to the disk file assignment problem
- May 23-26, Oakland, California, United States
- J. Wolf, The placement optimization program: a practical solution to the disk file assignment problem, Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, p.1-10, May 23-26, 1989, Oakland, California, United States
- (1989) Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems , pp. 1-10
- Wolf, J.¹

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