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. Conferences, Workshops, Symposiums, and Seminars
  4. Lisp Extensions for Multiprocessing
 
Loading...
Thumbnail Image
conference paper

Lisp Extensions for Multiprocessing

Zorn, Benjamin G.
•
Ho, Kinson
•
Larus, James
Show more
1989
Twenty-Second Hawaii International Conference on System Sciences, Vol.II: Software Track

Extensions to Common Lisp for concurrent computation on multiprocessors are discussed. Functions for process creation, communication, and synchronization are described. Process objects create multiple threads of control. Processes are lightweight so that programmers can use them to take advantage of fine-grained parallelism. Communication and synchronization are managed with mailboxes. Signals allow processes to communicate using asynchronous interrupts. These constructs are used to implement several higher-level multiprocessing abstractions. These include structured processes, a parallel tree search, and dataflow computation

  • Details
  • Metrics
Type
conference paper
DOI
10.1109/HICSS.1989.48084
Author(s)
Zorn, Benjamin G.
•
Ho, Kinson
•
Larus, James
•
Semenzato, Luigi
•
Hilfinger, Paul
Date Issued

1989

Publisher

IEEE

Published in
Twenty-Second Hawaii International Conference on System Sciences, Vol.II: Software Track
Volume

2

Start page

761

End page

770

Peer reviewed

REVIEWED

Written at

OTHER

EPFL units
VLSC  
Available on Infoscience
December 23, 2013
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/98689
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