메뉴 건너뛰기




Volumn , Issue , 2005, Pages 26-35

A linear-time algorithm for optimal barrier placement

Author keywords

Barrier synchronization; Circular arc graph; Nested circular interval graph; Nested loops; SPMD code

Indexed keywords

LINEAR SYSTEMS; OPTIMIZATION; PROBLEM SOLVING; SYNCHRONIZATION;

EID: 31844455524     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1065944.1065949     Document Type: Conference Paper
Times cited : (9)

References (12)
  • 4
    • 31844431812 scopus 로고    scopus 로고
    • Nested circular intervals: A model for barrier placement in SPMD codes with nested loops
    • LIP, ENS-Lyon, Dec.
    • A. Darte and R. Schreiber. Nested circular intervals: A model for barrier placement in SPMD codes with nested loops. Technical Report RR2004-57, LIP, ENS-Lyon, Dec. 2004. http://www.ens-lyon.fr/LIP/ Pub/Rapports/RR/RR2004/RR2004- 57.pdf.
    • (2004) Technical Report , vol.RR2004-57
    • Darte, A.1    Schreiber, R.2
  • 6
    • 0026420045 scopus 로고
    • Linear time algorithms on circular-arc graphs
    • W.-L. Hsu and K.-H. Tsai. Linear time algorithms on circular-arc graphs. Information Processing Letters, 40(3):123 129, 1991.
    • (1991) Information Processing Letters , vol.40 , Issue.3 , pp. 123129
    • Hsu, W.-L.1    Tsai, K.-H.2
  • 7
    • 84976718540 scopus 로고
    • Algorithms for scalable synchronization on shared-memory multiprocessors
    • J. M. Mellor-Crummey and M. L. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Transactions on Computer Systems, 9(1):21-65, 1991.
    • (1991) ACM Transactions on Computer Systems , vol.9 , Issue.1 , pp. 21-65
    • Mellor-Crummey, J.M.1    Scott, M.L.2


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