Stochastic flexible flow shop scheduling problem (SFFSSP) is one the main focus of researchers due to the complexity arises from inherent uncertainties and also the difficulty of solving such NP-hard problems. Conventionally, in such problems each machine’s job process time may encounter uncertainty due to their relevant random behaviour. In order to examine such problems more realistically, fi...

CPU scheduling is defined as scheduling multiple processes that are required to be executed in a specific time period. A large number of scheduling algorithms have been proposed to achieve maximum CPU utilization/throughput and minimizing turn around, waiting and response time. Existing studies claim that Round Robin (RR) is providing best results in terms of above-mentioned factors. In RR, a p...

The ARTiS system, a real-time extension of the GNU/Linux scheduler dedicated to SMP (Symmetric Multi-Processors) systems is proposed. ARTiS exploits the SMP architecture to guarantee the preemption of a processor when the system has to schedule a real-time task. The basic idea of ARTiS is to assign a selected set of processors to realtime operations. A migration mechanism of non-preemptible tas...

This paper is motivated by the problem of capturing and releasing the CPU by a routine software application in order to accommodate other non-routine requests that need the CPU. Specifically, we consider a network of distributed software agents where each agent is assigned with routine tasks that need to be processed by a CPU. The CPU also receives requests from other processes running on the m...

The k-nearest neighbor algorithm (kNN) is a critical algorithm used extensively in fields such as Computer Vision, Robotics, and Machine Learning. In this work, we address the performance of FLANN, a popular kNN library, at the node-level by co-designing indexing and search algorithms with software support. We characterize, profile, and optimize FLANN for high-dimensionality (e.g., ≥ 4096) for ...

This paper extends the previous work of authors and presents a non-layered Finite Volume formulation for the elasto-plastic analysis of Mindlin-Reissner plates. The incremental algorithm of the elasto-plastic solution procedure is shown in detail. The performance of the formulation is examined by analyzing of plates with different boundary conditions and loading types. The results are illustrat...

A modified Smoothed Particle Hydrodynamics (SPH) method is proposed for fluid-structure interaction (FSI) problems especially, in cases which FSI is combined with solid-rigid contacts. In current work, the modification of the utilized SPH concerns on removing the artificial viscosities and the artificial stresses (which such terms are commonly used to eliminate the effects of tensile and numeri...

  The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, tw...

INTRODUCTION AND OBJECTIVES To determine the prevalence and clinical characteristics of non-traumatic chest pain, to assess the quality of treatment provided by an emergency department chest pain unit (CPU), and to provide a theoretical estimate of the size of future CPUs. METHODS This prospective study included 1000 consecutive patients with chest pain seen at a CPU and a second group compri...