Fairness in shared invocation servicing |
| |
| Affiliation: | 1. Department of Computer Science, University of California, Davis, CA 95616-8562, USA;2. Department of Computer Science, University of San Francisco, San Francisco, CA 94117, USA;3. Department of Computer Science, California Polytechnic State University, San Luis Obispo, CA 93407, USA;1. University of Cauca, Cll. 5 4-70 Popayán, Colombia;2. Universidad Carlos III de Madrid, Av. Universidad 30, 28911 Leganés, Spain;3. University of East London, Docklands Campus, London E16 2RD, United Kingdom;1. National Institute for Fusion Science, 322-6 Oroshi-cho, Toki, Gifu 509-5292, Japan;2. Japan Atomic Energy Agency, 801-1 Mukoyama, Naka, Ibaraki 311-0193, Japan;1. Department of Mathematics, Faculty of Science and Technology, Science University of Tokyo, 2641 Yamazaki, Noda, Chiba (278-8510), Japan;2. Department of Mathematics, University of Bergen, PO Box 7803, Bergen N-5020, Norway |
| |
| Abstract: | Invocation servicing is an important aspect of many concurrent programming languages. Some invocation handling mechanisms allow for multiway servicing by multiple processes. This paper addresses fairness with respect to choosing which invocation to service and fairness with respect to choosing which process to perform the servicing. It examines how these fairness issues have been resolved in the SR concurrent programming language. This paper presents a new approach that eliminates several key restrictions. The new approach has been implemented in JR, an extended Java that includes SR-like synchronization mechanisms. This paper discusses design and implementation issues and tradeoffs. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
