2,201 research outputs found
Algorithms for Hierarchical and Semi-Partitioned Parallel Scheduling
We propose a model for scheduling jobs in a parallel machine setting that takes into account the cost of migrations by assuming that the processing time of a job may depend on the specific set of machines among which the job is migrated. For the makespan minimization objective, the model generalizes classical scheduling problems such as unrelated parallel machine scheduling, as well as novel ones such as semi-partitioned and clustered scheduling. In the case of a hierarchical family of machines, we derive a compact integer linear programming formulation of the problem and leverage its fractional relaxation to obtain a polynomial-time 2-approximation algorithm. Extensions that incorporate memory capacity constraints are also discussed
Mobile Edge Computing via a UAV-Mounted Cloudlet: Optimization of Bit Allocation and Path Planning
Unmanned Aerial Vehicles (UAVs) have been recently considered as means to
provide enhanced coverage or relaying services to mobile users (MUs) in
wireless systems with limited or no infrastructure. In this paper, a UAV-based
mobile cloud computing system is studied in which a moving UAV is endowed with
computing capabilities to offer computation offloading opportunities to MUs
with limited local processing capabilities. The system aims at minimizing the
total mobile energy consumption while satisfying quality of service
requirements of the offloaded mobile application. Offloading is enabled by
uplink and downlink communications between the mobile devices and the UAV that
take place by means of frequency division duplex (FDD) via orthogonal or
non-orthogonal multiple access (NOMA) schemes. The problem of jointly
optimizing the bit allocation for uplink and downlink communication as well as
for computing at the UAV, along with the cloudlet's trajectory under latency
and UAV's energy budget constraints is formulated and addressed by leveraging
successive convex approximation (SCA) strategies. Numerical results demonstrate
the significant energy savings that can be accrued by means of the proposed
joint optimization of bit allocation and cloudlet's trajectory as compared to
local mobile execution as well as to partial optimization approaches that
design only the bit allocation or the cloudlet's trajectory.Comment: 14 pages, 5 figures, 2 tables, IEEE Transactions on Vehicular
Technolog
Exact and heuristic allocation of multi-kernel applications to multi-FPGA platforms
FPGA-based accelerators demonstrated high energy efficiency compared to GPUs and CPUs. However, single FPGA designs may not achieve sufficient task parallelism. In this work, we optimize the mapping of high-performance multi-kernel applications, like Convolutional Neural Networks, to multi-FPGA platforms. First, we formulate the system level optimization problem, choosing within a huge design space the parallelism and number of compute units for each kernel in the pipeline. Then we solve it using a combination of Geometric Programming, producing the optimum performance solution given resource and DRAM bandwidth constraints, and a heuristic allocator of the compute units on the FPGA cluster.Peer ReviewedPostprint (author's final draft
- …