Results 271 to 280 of about 86,360 (312)
Some of the next articles are maybe not open access.
Optimal schedule for anthracyclines
European Journal of Cancer and Clinical Oncology, 1985Commentaire sur l'article de L'European. J. cancer. clin.
openaire +2 more sources
LINEAR SCHEDULING IS NEARLY OPTIMAL
Parallel Processing Letters, 1991This paper deals with the problem of finding optimal schedulings for uniform dependence algorithms. Given a convex domain, let Tf be the total time needed to execute all computations using the free (greedy) schedule and let Tl be the total time needed to execute all computations using the optimal linear schedule.
Darte, Alain +2 more
openaire +2 more sources
On the Optimality of Feautrier’s Scheduling Algorithm
Concurrency and Computation: Practice and Experience, 2002AbstractFeautrier's scheduling algorithm is the most powerful existing algorithm for parallelism detection and extraction, but it has always been known to be suboptimal. However, the question as to whether it may miss some parallelism because of its design has not been answered. We show that this is not the case.
openaire +3 more sources
Optimal Randomized Scheduling by Replacement
Journal of Combinatorial Optimization, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Optimal scheduling policies and the performance of the CDF scheduling
2014 48th Asilomar Conference on Signals, Systems and Computers, 2014We seek to characterize the performance of scheduling policies for wireless systems that are based on Cumulative Density Functions (CDF) of the channels. We first derive optimal scheduling policies for a two-user system under max-sum rate and max-min rate performance criteria subject to the same temporal resource constraints as those under CDF-based ...
PhuongBang C. Nguyen, Bhaskar Rao 0001
openaire +1 more source
On Optimal Processor Scheduling for Multiprogramming
SIAM Journal on Computing, 1973This paper investigates the problem of scheduling a processor to optimize throughput in a multiprogramming environment.
openaire +1 more source
An Optimal Drum Scheduling Algorithm
IEEE Transactions on Computers, 1972Suppose a set of N records must be read or written from a drum, fixed-head disk, or similar storage unit of a computer system. The records vary in length and are arbitrarily located on the surface of the drum. The problem considered here is to find an algorithm that schedules the processing of these records with the minimal total amount of rotational ...
openaire +1 more source
Near-optimal multiprocessor scheduling
Proceedings of the 1992 ACM annual conference on Communications - CSC '92, 1992Problems in employing several processors to execute a program can be identified as: a) discovering the potential parallelism of execution in different portions of the same program, and b) scheduling of the resulting task system. This research concentrates on the latter problem.
Farideh A. Samadzadeh, George E. Hedrick
openaire +1 more source
Optimal Scheduling of Fallible Inspections
Operations Research, 1996This paper gives the exact optimal solution to the problem of designing inspection schedules with fallible and time-consuming test procedures. The optimality criterion is designed to achieve a balance between the cost of inspections and the cost of undetected failure. The solution is derived in continuous time, with arbitrary failure distribution, and
openaire +2 more sources