2013
DOI: 10.1016/j.eswa.2012.11.005
|View full text |Cite
|
Sign up to set email alerts
|

The solution algorithms for the multiprocessor scheduling with workspan criterion

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2013
2013
2015
2015

Publication Types

Select...
4
1
1

Relationship

1
5

Authors

Journals

citations
Cited by 11 publications
(5 citation statements)
references
References 18 publications
0
5
0
Order By: Relevance
“…The eDiab is designed to be adaptive, meaning that it keeps the quality of services at the desired level. Unlike the applications described above, it is able to reconfigure in response to variations in network traffic [29,30].…”
Section: Ediabmentioning
confidence: 91%
“…The eDiab is designed to be adaptive, meaning that it keeps the quality of services at the desired level. Unlike the applications described above, it is able to reconfigure in response to variations in network traffic [29,30].…”
Section: Ediabmentioning
confidence: 91%
“…Optimizing these functions to produce faster and smaller architectures is the main objective of the Polytope model; however, data dependencies conditions this aim. The function to perform the mapping between nodes and execution times is called scheduler [5], [6], [18], [21]. If there exists more than one possible schedule function, the fastest is preferred.…”
Section: A Design Methodologiesmentioning
confidence: 99%
“…With respect to a schedule S, the completion time of job i is denoted by C i , and the makespan is denoted by C max = max i∈J {C i }. The goal is to find a schedule that minimizes the workspan W max = m • C max , i.e., a product of the makespan and the number of processors m required in the schedule (Rudek et al 2013). In the three field notation (Graham et al 1979), the considered problem can be denoted as P| pr ec, line j |W max .…”
Section: Multiprocessor Job Scheduling Problem Formulationmentioning
confidence: 99%
“…The considered workspan objective function reflects the basic scenario of bonding both dimensions of a schedule, yet it has an easy and strong practical explanation, in which a financial cost of renting servers or hiring a crew concerns the whole duration of a schedule (Rudek et al 2013). The same criterion, a minimal bounding-box of a schedule, has been considered by Korf (2003) as a total labour cost.…”
Section: Multiprocessor Job Scheduling Problem Formulationmentioning
confidence: 99%