Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Complexity of the method of block paralleling structured programs

From MaRDI portal
Publication:1103392
Jump to:navigation, search

zbMath0645.68035MaRDI QIDQ1103392

A. P. Barban

Publication date: 1987

Published in: Programming and Computer Software (Search for Journal in Brave)


zbMATH Keywords

multiprocessor computing systemsanalysis of program parallelismfully structured programsIsolation of program fragmentsparalleling algorithms


Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01) Theory of operating systems (68N25) Theory of software (68N99)








This page was built for publication: Complexity of the method of block paralleling structured programs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1103392&oldid=13140361"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 31 January 2024, at 01:49.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki