Most existing research on Mixed-Criticality (MC) scheduling (see [1] for a review) has focused on dealing with different WCET estimations of a single piece of code. This is typically a consequence of different tools for determining worst... more
Using the CIFAR-10 dataset, this research investigates how parallel processing affects the Random Forest method's machine learning performance. Accuracy and training time are highlighted in the study as critical performance indicators.... more
Using the CIFAR-10 dataset, this research investigates how parallel processing affects the Random Forest method's machine learning performance. Accuracy and training time are highlighted in the study as critical performance indicators.... more
Modern embedded systems are based on Multiprocessor-Systems-on-Chip (MPSoCs) to meet the strict timing deadlines of multiple applications. MPSoC resources must be utilized efficiently by mapping the applications in throughputaware manner... more
In the parallel k-stage flow-shops problem, we are given m identical k-stage flow-shops and a set of jobs. Each job can be processed by any one of the flow-shops but switching between flow-shops is not allowed. The objective is to... more
Real-time embedded systems have increased in complexity. As microprocessors become more powerful, the software complexity of real-time embedded systems has increased steadily. The requirements for increased functionality and adaptability... more
Bark-scale warped linear prediction [WLP] is a very potential core for a monophonic perceptual audio codec [2]. In the current paper the WLP scheme is extended for processing complex valued signals (CWLP). Three different methods of... more
Minimizing makespan for the distributed hybrid flowshop scheduling problem with multiprocessor tasks
The trend of globalization has recently seen the study of distributed scheduling problems. This study attempts to solve the distributed hybrid flowshop scheduling problem with multiprocessor tasks, and is the first attempt to address this... more
We study the hardness of the non-preemptive scheduling problem of a list of independent jobs on a set of identical parallel processors with a makespan minimization objective. We make a maiden attempt to explore the combinatorial structure... more
In recent years, a number of database machines consisting of large numbers of parallel processing elements have been proposed. Unfortunately, there are two main limitations in database processing that prevent a high degree of parallelism;... more
Improving Multiprocessor Average-Case Schedulability using A Modified Global Dual Priority Algorithm
In this paper we present a modification of the Dual Priority Scheduling Algorithm to work on shared memory multiprocessor systems improving the average-case schedulability. The proposal deals with global fixedpriority preemptive... more
Neural networks present a fundamentally different model of computation from the conventional sequential digital model, for which conventional hardware is typically poorly matched. However, a combination of model and scalability... more
Partitioning and global scheduling are two approaches for scheduling real-time tasks on multiprocessors. Though partitioning is sub-optimal, it has traditionally been preferred; this is mainly due to the fact that well-understood... more
Pfair scheduling was proposed by Baruah, Cohen, Plaxton, and Varvel as a nonwork-conserving way of optimally and efficiently scheduling periodic tasks on a multiprocessor. In this paper, we introduce a work-conserving variant of Pfair... more
We consider the problem of scheduling periodic task systems on multiprocessors and present a deadline-based scheduling algorithm for solving this problem. We show that our algorithm successfully schedules on m processors any periodic task... more
We consider a problem of minimum length scheduling for conflict-free aggregation convergecast in wireless networks in a case when each element of a network uses its own frequency channel. This problem is equivalent to the well-known... more
The problem of scheduling a parallel program given by a Directed Acyclic Graph (DAG) of tasks is a well-studied area. We present a new approach which employs Differential Evolution to numerically optimize the priorities of tasks. Our... more
The problem of scheduling a parallel program given by a Directed Acyclic Graph (DAG) of tasks is a well-studied area. We present a new approach which employs Differential Evolution to numerically optimize the priorities of tasks. Our... more
The paper proposes using genetic algorithms -based learning classi er system CS to solve m ultiprocessor scheduling problem. After initial mapping tasks of a parallel program into processors of a parallel system, the agents associated... more
In this paper, we present a systematic approach to designing cellular automata- based algorithms for multiprocessor scheduling. We consider a simple case of two processors. However, we do not restrict parallel programs. We show how to... more
Multiprocessors are now dominant, but real multiprocessors do not provide the sequentially consistent memory that is assumed by most work on semantics and verification. Instead, they have subtle relaxed (or weak) memory models, usually... more
TCP's burstiness is usually regarded as harmful, or at best, inconvenient. Instead, this thesis suggests a new perspective and examines whether TCP's burstiness is useful for certain applications. It claims that burstiness can... more
General purpose: Present modeling techniques Special math needed for explanations: Probability, Markov models Special math needed to use results: Same Results useful to: Reliability analysts and multiprocessor designers Summary &... more
We consider the semi-online multiprocessor scheduling problem with m identical, parallel machines to minimize the makespan, where the jobs arrive in decreasing order of processing times. The famous Longest Processing Time (LPT) algorithm... more
Write a summary covering the purpose, methods, and main findings of the paper. Here’s an example: This paper presents an analysis of CPU scheduling algorithms, focusing on FCFS, SJF, RR, and Priority Scheduling. The study evaluates each... more
Part I of this paper presented a novel technique for approximate parallel scheduling and a new logarithmic time optimal parallel algorithm for the list ranking problem. In this part, we give a new logarithmic time parallel (PRAM)... more
Supercomputing power is one of the fundamental pillars of the digital society, which depends on the accurate scheduling of parallel applications in High-Performance Computing (HPC) centers to minimize computing times. However,... more
The growing gap between processor and memory speeds is motivating the need for optimization strategies that improve data locality. A major challenge is to devise techniques suitable for pointer-intensive applications. This paper presents... more
Multiprocessor scheduling is one of the thrust areas in the field of computational science. There are various traditional scheduling techniques exist for the allocation and processing of jobs. But the performance of these techniques... more
This paper reports preliminary experimental evaluation of a Processing Elements Stealing (PE-S) technique which was targeted as efficient and scalable load balancing technique for dynamically structured multiprocessor systems. The... more
Cellular automata (CAs) are interesting because complex global behaviour arises from simple local interactions. In this paper, CAs are proposed to design parallel scheduling algorithm for allocating tasks of a parallel program in the two... more
In this paper, we present a novel approach to designing cellular automata-based multiprocessor scheduling algorithms in which extracting knowledge about the scheduling process occurs. This knowledge can potentially be used while solving... more
The paper presents cellular automata (CA)-based multiprocessor scheduling system, in which an extraction of knowledge about scheduling process occurs and this knowledge is used while solving new instances of the scheduling problem. There... more
In this paper, a new approach to scheduling of parallel and distributed algorithms for multiprocessor systems is proposed. Its main innovation lies in evolving a decomposition of the global optimization criteria. For this purpose,... more
a su colaboración y apoyo ha sido posible la realización de esta Tesis. Y como no, a toda mi familia. A mis padres, hermanos, a mi mujer, Montse y a los pequeños, Sara y Roger, que han sabido entender en todo momento la dedicación que me... more
Particle Swarm Optimization (PSO) is a population-based metaheuristic (PBM), in which solution candidates evolve through simulation of a simplified social adaptation model. Putting together robustness, efficiency and simplicity, PSO has... more
We study shared processor scheduling of multiprocessor weighted jobs where each job can be executed on its private processor and simultaneously on possibly many processors shared by all jobs in order to reduce their completion times due... more
We further study the effect of odd cycle inequalities in the description of the polytopes associated with the p-median and uncapacitated facility location problems. We show that the obvious integer linear programming formulation together... more
In real-time task scheduling on multiprocessor systems, partitioning approach has received the attention of many researchers because of its higher least upper bound utilization of safe systems. Semi-partitioning allows some tasks to be... more
Given a task set , finding a feasible schedule for is one of the most significant problems of realtime embedded systems. The research community has found a lot of important results for the scheduling problem on both uniprocessor and... more
Partitioning and scheduling techniques are necessary to implement parallel languages on multiprocessors. Multiprocessor performance is maximized when parallelism between tasks is optimally traded off with communication and synchronization... more
The memory consistency model, or memory model, supported by a shared-memory multiprocessor directly affects its performance. The most commonly assumed memory model is sequential consistency (SC). While SC provides a simple model for the... more
![Figure 3. Examples of access categories and access labels. ignore unsuccessful test&sets. The test of a final test&set competes only with the unset that is required for the Figure 3(b) shows the implementation of a barrier [12] using an atomic fetch-and-increment operation [10]. test&set and unset. The while loop containing the test&set forms a synchronization loop construct; therefore, we The while loop containing the reads on flag forms a synchronization loop construct; therefore, we ignore the un- shown starting with an upper case letter). Figure 3(a) shows the implementation of locks and unlocks using](https://figures.academia-assets.com/118201913/table_001.jpg)
The event-driven model of computation provides a good platform for capturing complex real-time applications with low latency requirements since this model is free of problems like deadlocks, livelocks and performance bottlenecks such as... more
Previously, several works have been carried out on hierarchical scheduling frameworks from a theoretical point of view. In the recent past, hierarchical scheduling frameworks have been implemented on VxWorks for uniprocessor system. In... more
![This paper has presented our initial analysis and implementation of a hierarchical scheduling framework on a commercial operating system like VxWorks for SMP hardware. Although previous works on similar lines [20], have been proposed, we have tried to improvise them in our work by extending their implementation on SMP architecture. The decision to choose VxWorks as the target Operating System is to understand and explore the intricacies of such an industry dominant operating system. Another motivation for our work is to develop case studies both for academia and industry. We are able to identify that a hierarchical scheduling framework can effectively be implemented on multicore architectures with some overheads and can achieve the clean separation of subsystems in terms of timing characteristics. However, our proposed implementation does not consider the utilization of the cores with resource sharing. There is tremendous amount of future scope for our work that includes support for sporadic as well as aperiodic tasks. Sporadic tasks can be supported in response to specific events such as external interrupts. Support for aperiodic tasks could be done by bounding their interference to periodic tasks by the use of some server based mechanisms. Future implementation may also include support for AMP based systems.](https://figures.academia-assets.com/118043265/figure_004.jpg)