Optimal processor scheduling when service times are hyperexponentially distributed and preemption overhead is not negligible

View on Open Library

Optimal processor scheduling when service times are hyperexponentially distributed and preemption overhead is not negligible

by Kenneth C. Sevcik

No reviews yet

First published: 1972 1 language

Subjects

Electronic data processing Multiprogramming (Electronic computers)

Reviews

Log in or sign up to write a review.

No reviews yet. Be the first!

More by Kenneth C. Sevcik

The use of service time distributions in scheduling

The use of service time distributions in...

The use of service time distribution in scheduling

The use of service time distribution in ...

Workload characterization for the space station data communications system

Workload characterization for the space ...

Cycle time properties of the FDDI token ring protocol

Cycle time properties of the FDDI token ...

Application scheduling and processor allocation in multiprogrammed parallel processing systems

Application scheduling and processor all...

An interconnection network that exploits locality of communication

An interconnection network that exploits...

You Might Also Like

More in Electronic data proc...

Tax administration

Tax administration

United States. General Accounting Office

Advances in imaging and electron physics

Advances in imaging and electron physics

Peter W. Hawkes

Advances in Computers, Volume 49 (Advances in Computers)

Advances in Computers, Volume 49 (Advanc...

Marvin V. Zelkowitz

Course ILT

Course Technology

Tax administration

Tax administration

United States. General Accounting Office

Introducing Computers

Introducing Computers

Robert H. Blissmer