DocumentCode
1565925
Title
Virtual processing in ParMod
Author
Abstreiter, Franz
Author_Institution
Inst. for Inf., Tech. Univ. of Munich, West Germany
fYear
1988
Firstpage
245
Lastpage
251
Abstract
It is shown that scheduling is necessary for implementing programming languages which allow unbounded parallelism. On the other hand, programming of scheduling mechanisms and policies for parallel activities is desired in the parallel-programming language itself. ParMod supports user scheduling by means of suspension, region statements, sequence parts and pre parts. User scheduling restricts system scheduling. Nevertheless, there exist several system scheduling mechanisms and policies that guarantee a semantical correct implementation of user scheduling
Keywords
high level languages; parallel programming; scheduling; virtual machines; ParMod; parallel-programming language; policies; pre parts; programming languages; region statements; scheduling mechanisms; semantical correct implementation; sequence parts; suspension; unbounded parallelism; virtual processing; Computer languages; Dynamic programming; Hardware; Multiprocessing systems; Parallel languages; Parallel processing; Parallel programming; Processor scheduling; Programming profession; Runtime;
fLanguage
English
Publisher
ieee
Conference_Titel
Distributed Computing Systems in the 1990s, 1988. Proceedings., Workshop on the Future Trends of
Print_ISBN
0-8186-0897-8
Type
conf
DOI
10.1109/FTDCS.1988.26704
Filename
26704
Link To Document