Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. TreadMarks: Shared Memory Computing on Networks of Workstations
 
research article

TreadMarks: Shared Memory Computing on Networks of Workstations

Amza, C.
•
Cox, A.L.
•
Dwarkadas, S.
Show more
1996
IEEE Computer

TreadMarks supports parallel computing on networks of workstations by providing the application with a shared memory abstraction. Shared memory facilitates the transition from sequential to parallel programs. After identifying possible sources of parallelism in the code, most of the data structures can be retained without change, and only synchronization needs to be added to achieve a correct shared memory parallel program_ Additional transformations may be necessary to optimize performance, but this can be done in an incremental fashion. We discuss the techniques used in TreadMarks to provide efficient shared memory, and our experience with two large applications, mixed integer programming and genetic linkage analysis.

  • Files
  • Details
  • Metrics
Type
research article
DOI
10.1109/2.485843
Author(s)
Amza, C.
Cox, A.L.
Dwarkadas, S.
Keleher, P.
Lu, H.
Rajamony, R.
Yu, W.
Zwaenepoel, W.  
Date Issued

1996

Published in
IEEE Computer
Volume

29

Issue

2

Start page

18

End page

28

Editorial or Peer reviewed

REVIEWED

Written at

OTHER

EPFL units
LABOS  
Available on Infoscience
October 17, 2005
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/217808
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés