A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Optimizing Scheduling Stability for Runtime Data Alignment
[chapter]
2006
Lecture Notes in Computer Science
Runtime data alignment has been paid attention recently since it can allocate data segment to processors dynamically according to applications' requirement. One of the key optimizations of this problem is to schedule simultaneous communications to avoid contention and to minimize the overall communication costs. The NP-completeness of the problem has instigated researchers to propose different heuristic algorithms. In this paper, we present an algorithm independent technique for optimizing
doi:10.1007/11807964_83
fatcat:xbehlj5l6naezda4lqos4zkey4