prof. dr hab. inż. Krzysztof Giaro
- Department of Algorithms and Systems Modelling
- Faculty of Electronics, Telecommunications and Informatics
Head of Department
- Gmach Elektroniki Telekomunikacji i Informatyki pokój 236
- (58) 347 24 28
A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
We address a generalization of the classical 1- and 2-processor unit execution time scheduling problem on dedicated machines. In our chromatic model of scheduling machines have non-simultaneous availability times and tasks have arbitrary release times and due dates. Also, the versatility of our approach makes it possible to generalize all known classical criteria of optimality. Under these stipulations we show that the problem...
The Robinson–Foulds (RF) distance is the most popular method of evaluating the dissimilarity between phylogenetic trees. In this paper, we define and explore in detail properties of the Matching Cluster (MC) distance, which can be regarded as a refinement of the RF metric for rooted trees. Similarly to RF, MC operates on clusters of compared trees, but the distance evaluation is more complex. Using the graph theoretic approach...
seen 548 times