메뉴 건너뛰기




Volumn , Issue , 1998, Pages 87-93

RoltMP - Replay of lamport timestamps for message passing systems

Author keywords

[No Author keywords available]

Indexed keywords

MEMORY ARCHITECTURE; PROGRAM DEBUGGING;

EID: 85117456038     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/EMPDP.1998.647184     Document Type: Conference Paper
Times cited : (19)

References (18)
  • 4
    • 0022674023 scopus 로고
    • A probe effect in concurrent programs
    • March
    • J. Gait. A probe effect in concurrent programs. Software - Practice and Experience, 16(3):225-233, March 1986.
    • (1986) Software - Practice and Experience , vol.16 , Issue.3 , pp. 225-233
    • Gait, J.1
  • 5
    • 84957671521 scopus 로고    scopus 로고
    • Debugging distributed memory programs using communication graph manipulation
    • Montreal, Canada, June
    • S. Grabner and J. Volkert. Debugging distributed memory programs using communication graph manipulation. In Proceedings of HPCS 96 Conference, Montreal, Canada, June 1996.
    • (1996) Proceedings of HPCS 96 Conference
    • Grabner, S.1    Volkert, J.2
  • 7
    • 0017996760 scopus 로고
    • Time, clocks, and the ordering of events in a distributed system
    • July
    • L. Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7):558-565, July 1978.
    • (1978) Communications of the ACM , vol.21 , Issue.7 , pp. 558-565
    • Lamport, L.1
  • 8
    • 84976735880 scopus 로고
    • Pararex: A programming environment integrating execution replay and visualization
    • North-Holland, Amsterdam
    • E. Leu and A. Schiper. ParaRex: A programming environment integrating execution replay and visualization. In Environments and Tools for Parallel Scientific Computing, pages 155-169. North-Holland, Amsterdam, 1993.
    • (1993) Environments and Tools for Parallel Scientific Computing , pp. 155-169
    • Leu, E.1    Schiper, A.2
  • 11
    • 84863078358 scopus 로고
    • Minimizing the log size for execution replay of shared-memory programs
    • B. Buchberger and J. Volkert, editors, Berlin Heidelberg, Springer-Verlag
    • L. Levrouw and K. Audenaert. Minimizing the log size for execution replay of shared-memory programs. In B. Buchberger and J. Volkert, editors, Parallel Processing: CONPAR 94 - VAPP VI, LNCS 854, pages 76-87, Berlin Heidelberg, 1994. Springer-Verlag.
    • (1994) Parallel Processing: CONPAR 94 - VAPP VI, LNCS , vol.854 , pp. 76-87
    • Levrouw, L.1    Audenaert, K.2
  • 15
    • 0347043836 scopus 로고    scopus 로고
    • An experimental evaluation of a replay method for shared memory programs
    • E. D'Hollander, G. Joubert, F. Peters, D. Trystram, K. D. Bosschere, and J. Campenhout, editors, North-Holland, Gent
    • M. Ronsse and L. Levrouw. An experimental evaluation of a replay method for shared memory programs. In E. D'Hollander, G. Joubert, F. Peters, D. Trystram, K. D. Bosschere, and J. V. Campenhout, editors, Parallel Computing: State-of-the-Art and Perspectives, pages 399-406. North-Holland, Gent, 1996.
    • (1996) Parallel Computing: State-of-The-Art and Perspectives , pp. 399-406
    • Ronsse, M.1    Levrouw, L.2
  • 18
    • 0024088392 scopus 로고
    • A comparative study of libraries for parallel processing
    • of Computational Science III, Parallel Computing
    • D. Snelling and G.-R. Hoffman. A comparative study of libraries for parallel processing. In Proceedings of the Intl. Conference on Vector and Parallel Processors, volume 8 (1-3) of Computational Science III, Parallel Computing, pages 255-266, 1988.
    • (1988) Proceedings of the Intl. Conference on Vector and Parallel Processors , vol.8 , Issue.1-3 , pp. 255-266
    • Snelling, D.1    Hoffman, G.-R.2


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