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.
Efficient task scheduling is a challenging aspect of achieving high performance in parallel programming. Aiming at the problem that many heuristics for this NP-hard problem were always developed based on homogeneous systems and ignored the heterogeneity of processors which are not met on real parallel systems, this paper presents a heuristic algorithm based on list and task duplication for scheduling...
This letter proposes a novel factor graph equalization based on a serial layered scheduling (SLS) algorithm of belief propagation, where the channel convolutional matrix is decomposed according to the distribution of its non-zero elements. In the SLS algorithm based factor graph equalization, factor nodes are classified into multiple layers referring to the decomposition of channel convolutional matrix,...
Efficient task scheduling is critical for achieving high performance in heterogeneous computing systems. Many previous relevant works for Out-Tree task graphs focused on homogeneous environments, while neglecting the heterogeneity of processors and the economization on processors, which resulted in low practical efficiency. This paper presents a heuristic greedy algorithm based on list and task duplication...
Task scheduling is a challenging aspect of parallel programming. Aiming at the problem that most heuristics for this NP-hard problem always assume fully connected processors and concurrent inter-processor communication which are not met on real parallel systems, this paper proposes a communication contention-aware heuristic scheduling algorithm for Fork-Join task graphs, named CCAHS_FJ, which preserves...
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.