Skip Navigation

The Computer Journal 1977 20(2):132-136; doi:10.1093/comjnl/20.2.132
© 1977 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Wallach, Y.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Scheduling algorithms for concurrent execution

Y. Wallach *

Faculty of Electrical Engineering, Technion – Israel Institute of Technology, Technion City, Haifa, Israel

The paper introduces a notation for describing algorithms in a pseudo-mathematical form. It uses ideas introduced by various higher level programming languages, and by extensions proposed for concurrent processing. This notation is shown to be suitable to describe both sequential and concurrent scheduling schemes for numerical quadrature and matrix inversion. Additionally, pseudo-programs are developed for concurrent calculation of a scalar product of two vectors and of linear recurrence relations, as needed for a not too well known integration method.

Received September 1973.

* Faculty of Electrical Engineering, Technion – Israel Institute of Technology, Technion City, Haifa, Israel 32000


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.