By Topic

Deadlock-avoidance in a page-parallel rasterizer

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Birk, Y. ; IBM Almaden Res. Center, San Jose, CA, USA

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

Published in:

Information Technology, 1990. 'Next Decade in Information Technology', Proceedings of the 5th Jerusalem Conference on (Cat. No.90TH0326-9)

Date of Conference:

22-25 Oct 1990