Results 241 to 250 of about 1,093,881 (295)
Optimization of multi-objective flexible scheduling for container rail mounted gantry cranes in railway logistics yards. [PDF]
PLoS OneWang H, Xu C, Hou Y, Zhang J, Liu Z.
europepmc +1 more source
Adaptive graph-evolutionary framework for dynamic feature refinement in multi-label learning. [PDF]
Sci RepMovahed H, Toosi T, Nael S.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On parallelization of static scheduling algorithms
IEEE Transactions on Software Engineering, 1997Most static algorithms that schedule parallel programs represented by macro dataflow graphs are sequential. This paper discusses the essential issues pertaining to parallelization of static scheduling and presents two efficient parallel scheduling algorithms.
Wu, Min You, Shu, Wei
exaly +3 more sources
On Schedulability Bounds of Static Priority Schedulers
11th IEEE Real Time and Embedded Technology and Applications Symposium, 2005While utilization bound based schedulability test is simple and effective, it is often difficult to derive the bound itself. For its analytical complexity, utilization bound results are usually obtained on a case-by-case basis. In this paper, we develop a general framework that allows one to effectively derive schedulability bounds for a wide range of ...
Jianjia Wu, Jyh-Charn Liu, Wei Zhao 0001
openaire +2 more sources
Architectures for Statically Scheduled Dataflow
Journal of Parallel and Distributed Computing, 1990When dataflow program graphs can be statically scheduled, little run-time overhead (software or hardware) is necessary. This paper describes a class of parallel architectures consisting of Von Neumann processors and one or more shared memories, where the order of shared-memory accesses is determined at compile time and enforced at run time.
Edward A. Lee, Jeffery C. Bier
openaire +1 more source
Static-priority scheduling on multiprocessors
Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No.01PR1420), 2005The preemptive scheduling of systems of periodic tasks on a platform comprised of several identical processors is considered. A scheduling algorithm is proposed for static-priority scheduling of such systems; this algorithm is a simple extension of the uniprocessor rate-monotonic scheduling algorithm.
Björn Andersson +2 more
openaire +1 more source
Static scheduling of MPI tasks
Proceedings Second IEEE Symposium on Computer and Communications, 2002The paper addresses the problem of scheduling MPI tasks on the processing nodes of an MPI environment. The authors introduce a static scheduling system, in which program requirements are gathered, dependencies among the tasks are figured out, the computing environment is characterized, and a task assignment is generated.
Dale G. Smith, Hesham El-Rewini
openaire +2 more sources
Periodic schedules for Cyclo-Static Dataflow
The 11th IEEE Symposium on Embedded Systems for Real-time Multimedia, 2013Cyclo-Static Dataflow Graphs (CSDFGs in short) is a static model commonly used to describe communications between processes. It is increasingly considered for modeling applications executed by many-core architectures; their static analysis becomes thus essential for developing efficient compile-time optimization.
Bodin, Bruno +2 more
openaire +2 more sources
FlexRay Static Segment Scheduling
2011The FlexRay protocol was introduced by an international consortium including several car manufacturers to cope with growing real-time requirements of advanced driver assistance functions and safety functions in the automotive domain. The FlexRay protocol offers a static and dynamic segment with a high data rate of 10 Mbit/s.
Martin Lukasiewycz +3 more
openaire +1 more source