Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/28138
Title: | High performance wait-free thread scheduling on shared memory multiprocessors |
Authors: | Debattista, Kurt Vella, Kevin |
Keywords: | Computer science Parallel programming (Computer science) |
Issue Date: | 2002 |
Publisher: | CSREA Press |
Citation: | Debattista, K., & Vella, K. (2002). High performance wait-free thread scheduling on shared memory multiprocessors. International Conference on Parallel and Distributed Processing Techniques and Applications, Las Vegas. 1022-1030. |
Abstract: | We describe a system for effciently scheduling large numbers of user-level threads on shared memory multiprocessors. The scheduler augments the per-processor run queue model with wait-free data structures and a technique known as thread batching to balance the workload across processors while preserving cache content and minimising contention. Preliminary results indicate significant improvements in performance over the traditional lock-based shared run queue approach, especially when scheduling fine grained threads. |
URI: | https://www.um.edu.mt/library/oar//handle/123456789/28138 |
Appears in Collections: | Scholarly Works - FacICTCS |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
PDPTA2002 - Wait Free.pdf Restricted Access | 188.3 kB | Adobe PDF | View/Open Request a copy |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.