Conference item

A BSP Approach to the Scheduling of Tightly−Nested Loops

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Share
Cite

Cite this record

APA Style

Calinescu, R. (2015). A BSP Approach to the Scheduling of Tightly−Nested Loops.

MLA Style

Calinescu, R. “A BSP Approach to the Scheduling of Tightly−Nested Loops.” 2015.

Chicago Style

Calinescu, R. 2015. “A BSP Approach to the Scheduling of Tightly−Nested Loops.”
Print

Authors

+ Calinescu, R More by this author

Role:: Author

Publisher:: IEEE
Host title:: Proceedings of the 11th International Parallel Processing Symposium (IPPS'97)
Publication date:: 2015-01-01

UUID:: uuid:0c7a0920-1fc0-43b4-8765-1852d439ee65
Local pid:: cs:3474
Deposit date:: 2015-03-31
ARK identifier:: ark:/29072/ora_0c7a09201fc043b487651852d439ee65

Terms of use

Copyright date:: 2015

Licence:: Terms and Conditions of Use for Oxford University Research Archive

Views and Downloads

About views and downloads

If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP