Refined Fortran: an update

Refined Languages (Refined Fortran, Refined C, etc.) are extensions of their parent languages in which it is possible to express parallelism, but impossible to create races or deadlocks. Where strictly deterministic behavior is desired, multiple executions of a Refined Fortran program with the same...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings of the 1989 ACM/IEEE conference on Supercomputing s. 607 - 615
Hlavní autoři: Klappholz, D., Kong, X., Kalis, A. D.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: New York, NY, USA ACM 01.08.1989
IEEE
Edice:ACM Conferences
Témata:
Computer systems organization > Architectures > Parallel architectures
Concurrent computing
Costs
Detectors
Parallel processing
Permission
Program processors
Programming profession
Runtime
Sensor arrays
Software and its engineering > Software notations and tools > General programming languages > Language features
Software and its engineering > Software notations and tools > General programming languages > Language types
Software and its engineering > Software organization and properties > Contextual software domains > Operating systems > Process management
Theory of computation > Models of computation > Concurrency
Theory of computation > Models of computation > Concurrency > Parallel computing models
Writing
ISBN:9780897913416, 0897913418
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Refined Languages (Refined Fortran, Refined C, etc.) are extensions of their parent languages in which it is possible to express parallelism, but impossible to create races or deadlocks. Where strictly deterministic behavior is desired, multiple executions of a Refined Fortran program with the same input data can be guaranteed to either compute the same results or terminate with the same run-time errors regardless of differences in scheduling. Where asynchronous behavior is desired, freedom from races can be guaranteed. The Refined Languages approach achieves its goal by extending sequential imperative programming languages with data- (rather than control-) oriented constructs, and by viewing the expression of parallelism in data- (rather than control-) oriented terms. Earlier versions of Refined Fortran are discussed in [1]-[2]; the present work supersedes and extends work reported in these earlier publications.
Bibliografie:SourceType-Conference Papers & Proceedings-1
ObjectType-Conference Paper-1
content type line 25
ISBN:9780897913416
0897913418
DOI:10.1145/76263.76332