This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On-Line Control and Deadlock-Avoidance in a Page-Parallel Multiprocessor Rasterizer
February 1993 (vol. 4 no. 2)
pp. 155-163

A rasterizer converts a document described in some page-description language into asequence of full-page bitmaps (pagemaps), which can then be printed or displayed. Thepage-parallel rasterizer harnesses multiple processors to work on the same document,thereby permitting cost-effective high-speed rasterization of complex documents. Anygiven page is processed by a single processor, hence the name. For performance reasons,it is desirable to permit out-of-order rasterization as well as to share memory andcomputation results among the processors. However, this can result in deadlock. Onlinealgorithms are presented for controlling the rasterizer so as to avoid deadlock withoutbeing overly restrictive. It is shown that previously proposed approaches for deadlockavoidance cannot be applied directly due to a special form of nonexclusive allocation ofshared resources. A solution is given, thereby extending the applicability of deadlockavoidance. The approach should be useful in a variety of similar situations that may occurin other applications.

[1] J. L. Peterson and A. Silberschatz,Operating System Concepts. Reading, MA: Addison-Wesley, 1985.
[2] E. W. Dijkstra, "Cooperating sequential processes," Tech. Rep. EWD- 123, Technological Univ., Eindhoven, The Netherlands, 1965; reprinted inGen68, pp. 43-112.
[3] F. Genuys, Ed.,Programming Languages. London, England: Academic, 1968.
[4] A. N. Habermann, "Prevention of system deadlocks,"Commun. ACM, vol. 12, no. 7, pp. 373-377, July 1969.
[5] R. C. Holt, "On deadlock in computer systems," Ph.D. dissertation, Cornell Univ., 1971. (Also CSRG Tech. Rep. 6, CSD, Univ. Toronto.)
[6] R. C. Holt, "Some deadlock properties of computer systems,"ACM Comput. Surveys, vol. 4, no. 3, pp. 179-196, Sept. 1972.
[7] D. B. Lomet, "Subsystems of processes with deadlock avoidance,"IEEE Trans. Software Eng., vol. SE-6, no. 3, pp. 297-304, 1980.
[8] T. Minoura, "Deadlock avoidance revisited,"J. ACM, vol. 29, no. 4, pp. 1024-1048, 1982.
[9] S. S. Isloor and T. A. Marsland, "The deadlock problem: An overview,"IEEE Comput. Mag., vol. 13, pp. 58-78, 1980.
[10] K. C. Sevcik, "Comparison of concurrency control methods using analytical models,"Inform. Processing, pp. 847-858, 1983, R. E. A. Mason, Ed.
[11] M. C. Chen and M. Rem, "Deadlock-freedom in resource contentions,"Acta Informatica, vol. 21, pp. 585-598, Springer-Verlag, 1985.
[12] D. Zöbel. "The deadlock problem: A classifying bibliography,"Oper. Syst. Rev., vol. 17, no. 4, pp. 6-15, 1983.

Index Terms:
Index Termsonline control; deadlock-avoidance; page-parallel multiprocessor rasterizer;page-description language; full-page bitmaps; concurrency control; parallel processing;rendering (computer graphics)
Citation:
Y. Birk, "On-Line Control and Deadlock-Avoidance in a Page-Parallel Multiprocessor Rasterizer," IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 2, pp. 155-163, Feb. 1993, doi:10.1109/71.207591
Usage of this product signifies your acceptance of the Terms of Use.