DocumentCode :
275529
Title :
Deadlock-avoidance in a page-parallel rasterizer
Author :
Birk, Yitzhak
Author_Institution :
IBM Almaden Res. Center, San Jose, CA, USA
fYear :
1990
fDate :
22-25 Oct 1990
Firstpage :
89
Lastpage :
98
Abstract :
A rasterizer converts a document described in some page-description language into a sequence of full-page bitmaps (pagemaps), which can then be printed or displayed. The page-parallel rasterizer harnesses multiple processors to work on the same document. Any given page, however, is processed by a single processor, hence the name. For performance reasons, it is desirable to permit out-of-order rasterization. However, this can result in deadlock. It is shown how to pace the rasterizer so as to avoid deadlock without being overly restrictive. To do this, previously-proposed deadlock-avoidance schemes are extended to cases that seem to be outside their scope. The approach may also be useful in other applications
Keywords :
concurrency control; operating systems (computers); system recovery; deadlock-avoidance schemes; full-page bitmaps; page-description language; page-parallel rasterizer; performance; Collaboration; Costs; Image converters; Memory management; Registers; Resource management; Streaming media; System recovery; Throughput;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Technology, 1990. 'Next Decade in Information Technology', Proceedings of the 5th Jerusalem Conference on (Cat. No.90TH0326-9)
Conference_Location :
Jerusalem
Print_ISBN :
0-8186-2078-1
Type :
conf
DOI :
10.1109/JCIT.1990.128273
Filename :
128273
Link To Document :
بازگشت