The concept of signal-free management at road junctions is tailored for Connected and Automated Vehicles (CAVs), in which the conventional signal control replaced by various right-of-way assignment policies. First-Come-First-Served (FCFS) most commonly used policy. In proposed strategies, although traffic signals are replaced, organization vehicle trajectory remains same as that lights. As a na...

This paper evaluates the performance of job scheduling schemes for pure space sharing among rigid jobs. Conventional job scheduling schemes for the pure space sharing among rigid jobs have been achieved by First Come First Served (FCFS). However, FCFS has a drawback such that it can not utilize processors eeciently. This paper evaluates the performance of job scheduling schemes that are propose...

This study presents results for urban flood susceptibility mapping (FSM) using image-based 2D-convolutional neural networks (2D-CNN). The model input multiparametric spatial data comprised of land-useland-cover (LULC), digital elevation (DEM), and the topographic hydrologic conditioning derivatives, precipitation, soil types. implemented dropout regularization 2D-CNN with ReLU activation functi...

A new approach for dynamic job scheduling in mesh-connected multiprocessor systems, which supports a multiuser environment, is proposed in this paper. Our approach combines a submesh reservation policy with a priority-based scheduling policy to obtain high performance in terms of high throughput, high utilization, and low turn-around times for jobs. This high performance is achieved at the expe...

The problem of determining whether a set of tasks can be assigned to a set of heterogeneous processors in general is NP-hard. Generating an efficient schedule of tasks for a given application is critical for achieving high performance in a heterogeneous computing environment. This paper presents a novel algorithm based on Ant Colony Optimization (ACO) for the scheduling problem. An attempt is m...

In this paper, we investigate multi-class multi-server queueing systems with global FCFS policy, i.e., where customers requiring different types of service provided by distinct servers are accommodated in one common FCFS queue. In such scenarios, customers of one class (i.e., requiring a given type of service) may be hindered by customers of other classes. The purpose of this paper is twofold: ...

We consider exible manufacturing systems using thèFirst Come, First Served' (FCFS or FIFO) scheduling policy at each machine. We describe and discuss in some detail simple deterministic examples which have adequate capacity but which, under FCFS, can exhibit instability: unboundedly growing WIP taking the form of a repeated pattern of behavior with the repetitions on an increasing scale.

This memo describes First-Come, First-Served Source Address Validation Improvement (FCFS SAVI), a mechanism that provides source address validation for IPv6 networks using the FCFS principle. The proposed mechanism is intended to complement ingress filtering techniques to help detect and prevent source address spoofing.

Problem statement: Efficient scheduling of the tasks to heterogeneous processors for any application is critical in order to achieve high performance. Finding a feasible schedule for a given task set to a set of heterogeneous processors without exceeding the capacity of the processors, in general, is NP-Hard. Even if there are many conventional approaches available, people have been looking at ...