The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Parallel programs face a new security problem -- concurrency vulnerability, which is caused by a special thread scheduling instead of inputs. In this paper, we propose to automatically fix concurrency vulnerabilities by reducing thread scheduling space. Our method is based on two observations. First, most concurrency vulnerabilities are caused by atomicity violation errors. Second, reducing thread...
This paper investigates proportional fairness-oriented scheduling issues for multihop OFDMA systems with multiple relays. Based on the idealized L-hop linear network model, three adaptive proportional fair scheduling (PFS) algorithms, namely optimal PFS, iterative user pairing (IUP) PFS and successive distributed (SD) PFS, are proposed for multihop OFDMA systems. Different with the existing scheme...
In this paper we give a survey of multi-objective scheduling that have appeared in the literature or are to appear. Firstly, some basic concepts about multi-objective optimization and prevalent approaches for multi-objective optimization are given. Then, several multi-objective scheduling models are introduced and the comprehensive review of recent study on them is summarized. Finally, the trend of...
In this paper, three centralized packet scheduling schemes with fairness-oriented feature are proposed for OFDMA multihop relaying networks, namely Greedy polling with novel starvation restrained (SR-GP), enhanced proportional fairness with SR (SR-EPF) and novel subcarrier pairing with hop balance (HB-SP) scheduling algorithms. SR-GP can bring better fairness than traditional throughput-oriented algorithms...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.