Writing concurrent assemblers–a case study in path pascal

DOI10.1002/SPE.4380161206MaRDI QIDQ3740214zbMATH OpenOpenAlexFDO

Authors R. D. Dowsing, M. T. Sanderson

Publication date 1986

Published in Software: Practice and Experience (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/spe.4380161206

zbMATH Keywords

assemblerconcurrencyconcurrent algorithmsdistributed computingPAL-11APDP-11VAX 11-780VMS operating system

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Recommendations

• Programming a Bounded Buffer using the Object and Path Expression Constructs of Path Pascal
• Implementation of a Pascal based parallel language for a multiprocessor computer
• scientific article; zbMATH DE number 194148
• scientific article; zbMATH DE number 3967903
• scientific article; zbMATH DE number 42962

Cites work

• Communicating sequential processes
• scientific article; zbMATH DE number 3821076 (Why is no real title available?)
• scientific article; zbMATH DE number 3767008 (Why is no real title available?)

Cited in

(1)

• Programming a Bounded Buffer using the Object and Path Expression Constructs of Path Pascal

Describes a project that uses

Uses Software

• Modula
• Smalltalk
• Ada95
• PAL-11A
• Path Pascal

This page was built for publication: Writing concurrent assemblers–a case study in path pascal

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3740214)