Results 51 to 60 of about 1,304,220 (323)
Semi-Federated Scheduling of Parallel Real-Time Tasks on Multiprocessors
Federated scheduling is a promising approach to schedule parallel real-time tasks on multi-cores, where each heavy task exclusively executes on a number of dedicated processors, while light tasks are treated as sequential sporadic tasks and share the ...
Guan, Nan +3 more
core +1 more source
Project scheduling under uncertainty using fuzzy modelling and solving techniques [PDF]
In the real world, projects are subject to numerous uncertainties at different levels of planning. Fuzzy project scheduling is one of the approaches that deal with uncertainties in project scheduling problem.
Haït, Alain, Masmoudi, Malek
core +1 more source
Design of Optimal Scheduler for Process Scheduling [PDF]
CPU Scheduling takes plays an important role in multiprogramming systems. There are several programs present in memory. It is the responsibility of operating systems to select the process and assign it to CPU. There are various algorithms available for CPU Scheduling.
P. Harshavardhan Reddy +7 more
openaire +1 more source
Evolutionary interplay between viruses and R‐loops
Viruses interact with specialized nucleic acid structures called R‐loops to influence host transcription, epigenetic states, latency, and immune evasion. This Perspective examines the roles of R‐loops in viral replication, integration, and silencing, and how viruses co‐opt or avoid these structures.
Zsolt Karányi +4 more
wiley +1 more source
A position allocation approach to the scheduling of battery-electric bus charging
Robust charging schedules for a growing market of battery-electric bus (BEB) fleets are critical to successful adoption. In this paper, we present a BEB charging scheduling framework that considers spatiotemporal schedule constraints, route schedules ...
Alexander Brown +2 more
doaj +1 more source
Solving the Distributed Permutation Flow-Shop Scheduling Problem Using Constrained Programming
The permutation flow-shop scheduling problem is a classical problem in scheduling that aims at identifying the optimal sequence of jobs that should be processed in a number of machines in an effort to minimize makespan or some other performance criterion.
Christos Gogos
doaj +1 more source
Design citeria for applications with non-manifest loops [PDF]
In the design process of high-throughput applications, design choices concerning the type of processor architecture and appropriate scheduling mechanism, have to be made.
Krol, Thijs +2 more
core +1 more source
Circulating histones as clinical biomarkers in critically ill conditions
Circulating histones are emerging as promising biomarkers in critical illness due to their diagnostic, prognostic, and therapeutic potential. Detection methods such as ELISA and mass spectrometry provide reliable approaches for quantifying histone levels in plasma samples.
José Luis García‐Gimenez +17 more
wiley +1 more source
Efficient Robust Schedules (ERS) for Time-Aware Shaping in Time-Sensitive Networking
Time-Sensitive Networking (TSN) extends Ethernet bridging with features for deterministic transmission. Periodic streams may be scheduled such that their frames hardly interfere in bridges.
Thomas Stuber +2 more
doaj +1 more source
PGGA: A predictable and grouped genetic algorithm for job scheduling [PDF]
This paper presents a predictable and grouped genetic algorithm (PGGA) for job scheduling. The novelty of the PGGA is twofold: (1) a job workload estimation algorithm is designed to estimate a job workload based on its historical execution records, (2 ...
Li, M, Qi, M, Yu, B
core

