Task Scheduling on a Multiprocessor System with Independent Memories

@article{Kafura1977TaskSO,
  title={Task Scheduling on a Multiprocessor System with Independent Memories},
  author={Dennis G. Kafura and Vincent Yun Shen},
  journal={SIAM J. Comput.},
  year={1977},
  volume={6},
  pages={167-187}
}
  • Dennis G. Kafura, Vincent Yun Shen
  • Published in SIAM J. Comput. 1977
  • Computer Science
  • This paper considers a model of a computing system with several independent but identical processors, each with a private memory of limited, and possibly different, storage capacity. The tasks are assumed to have known resource demands expressed as processing times and memory requirements. Several scheduling strategies are evaluated by worst-case performance bounds and simulation results. Both preemptive and nonpreemptive scheduling are considered. An optimal preemptive algorithm is given to… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 20 CITATIONS

    Preemptive Scheduling of Uniform Processors with Memory.

    VIEW 7 EXCERPTS
    HIGHLY INFLUENCED

    A Simple Algorithm for Scheduling Jobs with GoS Levels

    VIEW 4 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    References

    Publications referenced by this paper.
    SHOWING 1-8 OF 8 REFERENCES

    GRAHAM,Bounds on multiprocessing timing anomalies

    • R L.
    • SIAM J. Appl. Math.,
    • 1969
    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    AND R. SETHI, Scheduling independent tasks to reduce mean finishing time

    • J. BRUNO, E. G. COFFMAN, JR
    • Comm. ACM,
    • 1974

    FARBER, Networks: Introduction, Datamation

    • D J.
    • 1972
    VIEW 1 EXCERPT

    Optimal scheduling for two-processor systems

    VIEW 1 EXCERPT

    The complexity o]

    • S. A. COOK
    • 1970
    VIEW 1 EXCERPT