메뉴 건너뛰기




Volumn 1, Issue , 2000, Pages 248-254

Building programs in the network of tasks model

Author keywords

[No Author keywords available]

Indexed keywords

ACYCLIC TASK GRAPHS; BUILDING PROJECTS; CODE REUSE; GRAPH CONSTRUCTION; PARALLEL LANGUAGES; SIDE EFFECT; TASK GRAPH;

EID: 0005080843     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/335603.335754     Document Type: Conference Paper
Times cited : (5)

References (21)
  • 2
    • 0032121299 scopus 로고    scopus 로고
    • Approaches for integrating task and data parallelism
    • July-August
    • H. Bal and M. Haines. Approaches for integrating task and data parallelism. IEEE Concurrency, 6, No. 3:74-84, July-August 1998.
    • (1998) IEEE Concurrency , vol.6 , Issue.3 , pp. 74-84
    • Bal, H.1    Haines, M.2
  • 4
    • 0024647596 scopus 로고
    • Algebraic identities for program calculation
    • February
    • R. Bird. Algebraic identities for program calculation. The Computer Journal, 32(2):122-126, February 1989.
    • (1989) The Computer Journal , vol.32 , Issue.2 , pp. 122-126
    • Bird, R.1
  • 5
    • 0016046965 scopus 로고
    • The parallel evaluation of general arithmetic expressions
    • April
    • R. Brent. The parallel evaluation of general arithmetic expressions. Journal of the ACM, 21, No.2:201-206, April 1974.
    • (1974) Journal of the ACM , vol.21 , Issue.2 , pp. 201-206
    • Brent, R.1
  • 7
    • 34547369545 scopus 로고    scopus 로고
    • Skeletons for data parallelism in p31
    • C. Lengauer, M. Griebl, and S. Gorlatch, editors, Proceedings of Europar'97, Springer-Verlag, Aug.
    • M. Danelutto, F. Pasqualetti, and S. Pelagatti. Skeletons for data parallelism in p31. In C. Lengauer, M. Griebl, and S. Gorlatch, editors, Proceedings of Europar'97, volume 1300 of LNCS, pages 619-628. Springer-Verlag, Aug. 1997.
    • (1997) LNCS , vol.1300 , pp. 619-628
    • Danelutto, M.1    Pasqualetti, F.2    Pelagatti, S.3
  • 16
    • 0030412221 scopus 로고    scopus 로고
    • Portability, predictability and performance for parallel computing: BSP in practice
    • December
    • J. Reed, K. Parrott, and T. Lanfear. Portability, predictability and performance for parallel computing: BSP in practice. Concurrency: Practice and Experience, 8(10):799-812, December 1996.
    • (1996) Concurrency: Practice and Experience , vol.8 , Issue.10 , pp. 799-812
    • Reed, J.1    Parrott, K.2    Lanfear, T.3
  • 18
    • 1442319459 scopus 로고    scopus 로고
    • Optimising data-parallel programs using the BSP cost model
    • September
    • D. Skillicorn, M. Danelutto, S. Pelagatti, and A. Zavanella. Optimising data-parallel programs using the BSP cost model. In Europar'98, pages 698-703, September 1998.
    • (1998) Europar'98 , pp. 698-703
    • Skillicorn, D.1    Danelutto, M.2    Pelagatti, S.3    Zavanella, A.4
  • 20
    • 0005058825 scopus 로고
    • Technical Report CMU-CS-94-112, School of Computer Science, Carnegie Mellon University, January
    • J. Subhlok, D. O'Hallaron, and T. Gross. Task parallel programming in Fx. Technical Report CMU-CS-94-112, School of Computer Science, Carnegie Mellon University, January 1994,
    • (1994) Task Parallel Programming in Fx
    • Subhlok, J.1    O'Hallaron, D.2    Gross, T.3


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