Stavros Birmpilis and Timotheos Aslanidis
National Technical University of Athens, Athens, Greece
In the past years, Interconnection Networks have been used quite often and especially in applications
where parallelization is critical. Message packets transmitted through such networks can be interrupted
using buffers in order to maximize network usage and minimize the time required for all messages to reach
their destination. However, preempting a packet will result in topology reconfiguration and consequently in
time cost. The problem of scheduling message packets through such a network is referred to as PBS and is
known to be NP-Hard. In this paper we haveimproved, critically, variations of polynomially solvable
instances of Open Shop to approximate PBS. We have combined these variations and called the induced
algorithmI_HSA (Improved Hybridic Scheduling Algorithm). We ran experiments to establish the efficiency
of I_HSA and found that in all datasets used it produces schedules very close to the optimal. In addition, we
tested I_HSA with datasets that follow non-uniform distributions and provided statistical data which
illustrates better its performance.To further establish I_HSA’s efficiency we ran tests to compare it to SGA,
another algorithm which when tested in the past has yielded excellent results.
KEYWORDS
Interconnection networks, packet scheduling, preemption, approximation
No comments:
Post a Comment