Static scheduling algorithms for allocating directed task graphs to multiprocessors
Static scheduling of a program represented by a directed task graph on a multiprocessor
system to minimize the program completion time is a well-known problem in parallel …
system to minimize the program completion time is a well-known problem in parallel …
A survey on scheduling strategies for workflows in cloud environment and emerging trends
Workflow scheduling is one of the challenging issues in emerging trends of the distributed
environment that focuses on satisfying various quality of service (QoS) constraints. The …
environment that focuses on satisfying various quality of service (QoS) constraints. The …
Latency-aware IoT service provisioning in UAV-aided mobile-edge computing networks
Advances in wireless communications are empowering the emerging Internet-of-Things
(IoT) applications and services with billions of connected devices. Mobile-edge computing …
(IoT) applications and services with billions of connected devices. Mobile-edge computing …
Gamma: Automating the hw mapping of dnn models on accelerators via genetic algorithm
DNN layers are multi-dimensional loops that can be ordered, tiled, and scheduled in myriad
ways across space and time on DNN accelerators. Each of these choices is called a …
ways across space and time on DNN accelerators. Each of these choices is called a …
Swapadvisor: Pushing deep learning beyond the gpu memory limit via smart swapping
It is known that deeper and wider neural networks can achieve better accuracy. But it is
difficult to continue the trend to increase model size due to limited GPU memory. One …
difficult to continue the trend to increase model size due to limited GPU memory. One …
Performance-effective and low-complexity task scheduling for heterogeneous computing
H Topcuoglu, S Hariri, MY Wu - IEEE transactions on parallel …, 2002 - ieeexplore.ieee.org
Efficient application scheduling is critical for achieving high performance in heterogeneous
computing environments. The application scheduling problem has been shown to be NP …
computing environments. The application scheduling problem has been shown to be NP …
A genetic algorithm for task scheduling on heterogeneous computing systems using multiple priority queues
On parallel and distributed heterogeneous computing systems, a heuristic-based task
scheduling algorithm typically consists of two phases: task prioritization and processor …
scheduling algorithm typically consists of two phases: task prioritization and processor …
Metaheuristics: A bibliography
Metaheuristics are the most exciting development in approximate optimization techniques of
the last two decades. They have had widespread successes in attacking a variety of difficult …
the last two decades. They have had widespread successes in attacking a variety of difficult …
Workflow scheduling in cloud: a survey
To program in distributed computing environments such as grids and clouds, workflow is
adopted as an attractive paradigm for its powerful ability in expressing a wide range of …
adopted as an attractive paradigm for its powerful ability in expressing a wide range of …
Serendipity: Enabling remote computing among intermittently connected mobile devices
Mobile devices are increasingly being relied on for services that go beyond simple
connectivity and require more complex processing. Fortunately, a mobile device encounters …
connectivity and require more complex processing. Fortunately, a mobile device encounters …