Scheduling Dependent Tasks with Memory Allocation in Multiprocessing Systems to Minimize Schedule Length

1977 ◽  
pp. 109-119
Author(s):  
Jan Węglarz
Keyword(s):  
Memory Allocation ◽  
Schedule Length ◽  
Multiprocessing Systems ◽  
Dependent Tasks ◽  
With Memory

Preemptive Scheduling for Two-Processor Systems

1988 ◽  
Vol 11 (1) ◽  
pp. 1-19
Author(s):  
Andrzej Rowicki
Keyword(s):  
Execution Time ◽  
Preemptive Scheduling ◽  
Total Execution Time ◽  
Schedule Length ◽  
Execution Times ◽  
Dependent Tasks

The purpose of the paper is to consider an algorithm for preemptive scheduling for two-processor systems with identical processors. Computations submitted to the systems are composed of dependent tasks with arbitrary execution times and contain no loops and have only one output. We assume that preemptions times are completely unconstrained, and preemptions consume no time. Moreover, the algorithm determines the total execution time of the computation. It has been proved that this algorithm is optimal, that is, the total execution time of the computation (schedule length) is minimized.

Capito-Lunate Fusion with Memory Staples

2015 ◽  
Vol 04 (S 01) ◽  
Author(s):  
M. Solomons
Keyword(s):  
With Memory

Design of Predistorter with Efficient Updating Algorithm of Power Amplifier with Memory Effect

2012 ◽  
Vol E95-C (3) ◽  
pp. 382-394
Author(s):  
Yasuyuki OISHI ◽  
Shigekazu KIMURA ◽  
Eisuke FUKUDA ◽  
Takeshi TAKANO ◽  
Daisuke TAKAGO ◽  
...  
Keyword(s):  
Memory Effect ◽  
Power Amplifier ◽  
With Memory
Sign in / Sign up

Export Citation Format

Share Document