Results 261 to 270 of about 1,093,881 (295)

Portioned static-priority scheduling on multiprocessors

2008 IEEE International Symposium on Parallel and Distributed Processing, 2008
This paper proposes an efficient real-time scheduling algorithm for multiprocessor platforms. The algorithm is a derivative of the rate monotonic (RM) algorithm, with its basis on the portioned scheduling technique. The theoretical design of the algorithm is well implementable for practical use.
Shinpei Kato, Nobuyuki Yamasaki
openaire   +2 more sources

STATIC SCHEDULING OF HIERARCHICAL PROGRAM GRAPHS

Parallel Processing Letters, 1995
Many parallel compilation systems represent programs internally as Directed Acyclic Graphs (DAGs). However, the storage of these DAGs becomes prohibitive when the program being compiled is large. In this paper we describe a compile-time scheduling methodology for hierarchical DAG programs represented in the IFX intermediate form. The method we present
openaire   +1 more source

Static job scheduling for environments with vertical elasticity

Concurrency and Computation: Practice and Experience, 2020
SummaryIn virtualized environments, such as Clouds, allocating a fixed amount of resources to a job a priori, may result in underutilization of the shared host. Meanwhile, vertical elasticity can be adopted to reduce the impact by resizing virtual machines (VMs) dynamically, in conjunction with suspension and/or migration before the host had been ...
Henrique Kloh, Vinod E. F. Rebello, Cristina Boeres, Bruno Schulze, Mariza Ferro   +4 more
openaire   +1 more source

Integrating and Scheduling an Open Set of Static Analyses

21st IEEE/ACM International Conference on Automated Software Engineering (ASE'06), 2006
To improve the productivity of the development process, more and more tools for static software analysis are tightly integrated into the incremental build process of an IDE. If multiple interdependent analyses are used simultaneously, the coordination between the analyses becomes a major obstacle to keep the set of analyses open. We propose an approach
Michael Eichberg, Mira Mezini, Sven Kloppenburg, Klaus Ostermann, Benjamin Rank   +4 more
openaire   +2 more sources

Static Task Scheduling

1988
Depending on the granularity of the different parts of a program we have low and high level spreading for fine and coarse grain program modules respectively. Most instances of the spreading problem are NP-Complete [GaJo79]. In this chapter we discuss optimal solutions for some instances of high level spreading, and efficient heuristics for the ...
openaire   +1 more source

Collective Communication on FPGA Clusters with Static Scheduling

ACM SIGARCH Computer Architecture News, 2017
FPGA-centric clouds and clusters provide direct and programmable interconnects with obvious benefits for communication latency and bandwidth. One rarely studied aspect of DPI is that they facilitate application-aware routing: if communication patterns are static and known a priori, as is usually the case, then judicious routing can reduce congestion ...
Jiayi Sheng, Qingqing Xiong, Chen Yang 0010, Martin C. Herbordt   +3 more
openaire   +2 more sources

A static scheduling heuristic for heterogeneous processors

1996
This paper presents a static scheduling heuristic called bestimaginary-level (BIL) scheduling for heterogeneous processors. The input graph is an acyclic precedence graph, where a node has different execution times on different processors. The static level of a node, or BIL, incorporates the effect of interprocessor communication (IPC) overhead and ...
Hyunok Oh, Soonhoi Ha
openaire   +2 more sources

Static Scheduling of Conditional Branches in Parallel Programs

Journal of Parallel and Distributed Computing, 1995
Abstract The problem of scheduling non-deterministic graphs arises in several situations in scheduling parallel programs, particularly in the cases of loops and conditional branching. When scheduling loops in a parallel program, non-determinism arises because the number of loop iterations may not be known before the execution of the program. However,
Hesham El-Rewini, Hesham H. Ali
openaire   +1 more source

DASS: Combining Dynamic & Static Scheduling in High-Level Synthesis

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2022
Lana Josipovic, John Wickerson, George Constantinides   +2 more
exaly  

Static and Dynamic Loop Scheduling

1988
Loops are the largest potential source of program parallelism and the problem of using several processors for the fast execution of complex parallel loops has attracted considerable attention in the last few years [PoKu87], [PoKP86], [TaPe86], [KrWe85], [PaKL80], [Cytr84].
openaire   +1 more source