1989
DOI: 10.1002/scj.4690201005
|View full text |Cite
|
Sign up to set email alerts
|

Scheduling jobs on a multiprocessor system with a common memory

Abstract: This paper studies the problem of scheduling jobs on a multiprocessor system with a common memory to minimize \documentclass{article}\pagestyle{empty}\begin{document}$ \sum\limits_{i = 1}^n {w_i \left({f_i } \right)} $\end{document}, where fi denotes flow‐times of jobs i, and wi(fi) denotes monotonically nondecreasing functions of fi. Arriving jobs are assigned to available processors according to an appropriate scheduling rule. Once a job is placed on a processor, it retains the processor during its processin… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 3 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?