메뉴 건너뛰기




Volumn , Issue , 2001, Pages 244-255

Local scheduling for distributed cooperation

Author keywords

[No Author keywords available]

Indexed keywords


EID: 84964335841     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/NCA.2001.962540     Document Type: Conference Paper
Times cited : (5)

References (27)
  • 2
    • 0034893155 scopus 로고    scopus 로고
    • Performing Tasks on Restartable Message-Passing Processors
    • Chlebus, B.S., De Prisco, R., Shvartsman, A.A: Performing Tasks on Restartable Message-Passing Processors. Distributed Computing, Vol. 14 1 (2001) 49-64.
    • (2001) Distributed Computing , vol.14 , Issue.1 , pp. 49-64
    • Chlebus, B.S.1    De Prisco, R.2    Shvartsman, A.A.3
  • 3
    • 0024683642 scopus 로고
    • Applications of Combinatorial Designs in Computer Science
    • Colbourn, C. J., van Oorschot, P. C.: Applications of Combinatorial Designs in Computer Science. ACM Computing Surveys, Vol. 21. 2 (1989)
    • (1989) ACM Computing Surveys , vol.21 , Issue.2
    • Colbourn, C.J.1    Van Oorschot, P.C.2
  • 6
    • 0001280843 scopus 로고    scopus 로고
    • Performing Work Efficiently in the Presence of Faults
    • Dwork, C., Halpern, J., Waarts, O.: Performing Work Efficiently in the Presence of Faults. SIAM J. on Computing, Vol. 27 5. (1998) 1457-1491
    • (1998) SIAM J. on Computing , vol.27 , Issue.5 , pp. 1457-1491
    • Dwork, C.1    Halpern, J.2    Waarts, O.3
  • 11
    • 0003780715 scopus 로고
    • Reading, MA: Addison-Wesley
    • Harary, E: Graph Theory. Reading, MA: Addison-Wesley (1994)
    • (1994) Graph Theory
    • Harary, E.1
  • 17
    • 0022146483 scopus 로고
    • A fast parallel algorithm for the maximal independent set problem
    • Karp, R.M., Wigderson, A.: A fast parallel algorithm for the maximal independent set problem. JACM, Vol. 32 4(1985) 762-773
    • (1985) JACM , vol.32 , Issue.4 , pp. 762-773
    • Karp, R.M.1    Wigderson, A.2
  • 21
    • 0022069122 scopus 로고
    • A √N Algorithm for Mutual Exclusion in Decentralized Systems
    • Maekawa, M.: A √N Algorithm for Mutual Exclusion in Decentralized Systems. ACM Tran. on Computer Systems. Vol. 3(2) (1985) 145-159
    • (1985) ACM Tran. on Computer Systems , vol.3 , Issue.2 , pp. 145-159
    • Maekawa, M.1
  • 23
    • 23044522331 scopus 로고    scopus 로고
    • Distributed Cooperation During the Absence of Communication
    • 14th International Conference on Distributed Computing, (Preliminary version: Brief announcement. ACM Symposium on Principles of Distributed Computing. (2000))
    • Malewicz, G., Russell, A., Shvartsman, A.A.: Distributed Cooperation During the Absence of Communication. 14th International Conference on Distributed Computing, LNCS Vol. 1914 (2000) 119-133 (Preliminary version: Brief announcement. ACM Symposium on Principles of Distributed Computing. (2000))
    • (2000) LNCS , vol.1914 , pp. 119-133
    • Malewicz, G.1    Russell, A.2    Shvartsman, A.A.3
  • 24
    • 34547538473 scopus 로고    scopus 로고
    • Computing with Infinitely Many Processes (under assumptions in concurrency and participation)
    • 14th International Conference on Distributed Computing
    • Merritt, M., Taubenfeld, G.: Computing with Infinitely Many Processes (under assumptions in concurrency and participation). 14th International Conference on Distributed Computing, LNCS Vol. 1914 (2000) 164-178
    • (2000) LNCS , vol.1914 , pp. 164-178
    • Merritt, M.1    Taubenfeld, G.2


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