2,781 research outputs found
Parking functions on toppling matrices
Let be an integer -matrix which satisfies the
conditions: , and
there exists a vector such that . Here the notation means that for all , and
means that for every . Let
be the set of vectors such that and
. In this paper, -parking functions are
defined for any . It is proved that the set of
-parking functions is independent of for any . For this reason, -parking
functions are simply called -parking functions. It is shown that the
number of -parking functions is less than or equal to the determinant
of . Moreover, the definition of -recurrent
configurations are given for any . It is proved
that the set of -recurrent configurations is independent of
for any . Hence, -recurrent configurations are simply called -recurrent
configurations. It is obtained that the number of -recurrent
configurations is larger than or equal to the determinant of . A simple
bijection from -parking functions to -recurrent configurations
is established. It follows from this bijection that the number of
-parking functions and the number of -recurrent configurations
are both equal to the determinant of
Scheduling Coflows for Minimizing the Makespan in Identical Parallel Networks
With the development of technology, parallel computing applications have been
commonly executed in large data centers. These parallel computing applications
include the computation phase and communication phase, and work is completed by
repeatedly executing these two phases. However, due to the ever-increasing
computing demands, large data centers are burdened with massive communication
demands. Coflow is a recently proposed networking abstraction to capture
communication patterns in data-parallel computing frameworks. This paper
focuses on the coflow scheduling problem in identical parallel networks, where
the goal is to minimize makespan, the maximum completion time of coflows. The
coflow scheduling problem in huge data center is considered one of the most
significant -hard problems. In this paper, coflow can be considered as
either a divisible or an indivisible case. Distinct flows in a divisible coflow
can be transferred through different network cores, while those in an
indivisible coflow can only be transferred through the same network core. In
the divisible coflow scheduling problem, this paper proposes a
-approximation algorithm, and a
-approximation algorithm, where is the number
of network cores. In the indivisible coflow scheduling problem, this paper
proposes a -approximation algorithm. Finally, we simulate our proposed
algorithm and Weaver's [Huang \textit{et al.}, In 2020 IEEE International
Parallel and Distributed Processing Symposium (IPDPS), pages 1071-1081, 2020.]
and compare the performance of our algorithms with that of Weaver's
- β¦