In vehicular edge computing (VEC), tasks and data collected by sensors on the vehicles can be offloaded to roadside units (RSUs) equipped with a set of servers through wireless transmission. These may dependent each other modeled as directed acyclic graph (DAG). The DAG scheduling problem is aimed at minimize length (makespan), i.e., maximum finish time all tasks. conventional heuristic algorit...

Look-ahead dynamic inter-processor connection reconfiguration is a multi-processor architectural model, which has been proposed to eliminate connection reconfiguration time overheads. It consists in preparing link connections in advance in parallel with program execution. An application program is partitioned into sections, which are executed using redundant communication resources. Parallel pr...

Aim of this presentation is to introduce a tabu search algorithm for a general scheduling problem modeled by means of the alternative graph. The alternative graph is a mathematical model, which is based on a generalization of the disjunctive graph of Roy and Sussman [6]. It allows a detailed representation of many scheduling problems. It was successfully applied to several real world environmen...

This article introduces multiprocessor scheduling algorithms based upon cellular automata. To design cellular automata corresponding to a given program graph a generic definition of program graph neighborhood is used, transparent to the various kinds, sizes and shapes of program graphs. The cellular automata-based scheduler works in two modes. In learning mode a genetic algorithm (GA) is applie...

A.n efficient use of a Distributed Heterogeneous Supercomputing System (DHSS) requhes a thorough understanding of applications and their intelligent scheduling within the system. In this paper we present a general management framework for the DHSS, by introducing an application characterization technique, called Code Flow Graph (CFG) and Code Interaction Graph (CIG). These models are based on c...

Graph-based algorithms for point-to-multipoint broadcast scheduling in Spatial reuse Time Division Multiple Access (STDMA) wireless ad hoc networks often result in a significant number of transmissions having low Signal to Interference and Noise density Ratio (SINR) at intended receivers, leading to low throughput. To overcome this problem, we propose a new algorithm for STDMA broadcast schedul...

Chain-based scheduling 1] is an eecient partitioning and scheduling scheme for nested loops on distributed-memory multicomputers. The idea is to take advantage of the regular data dependence structure of a nested loop to overlap and pipeline the communication and computation. Most partitioning and scheduling algorithms proposed for nested loops on multicomputers 1,2,3] are graph algorithms on t...