New answers tagged

1 vote
Accepted

A lower bound for the makespan of heterogenous fog nodes

Under the assumption that $EXT(N_i) = \mathit{MinMakespan}$, $$ \sum_{k \in N_i \mathit{Tasks}} \mathit{length}(T_k) = \mathit{MinMakespan} \times \mathit{CPUrate}(N_i). $$ Therefore $$ \sum_k \mathit{...
user avatar
0 votes
Accepted

Why there is no user interaction between uni-programming and multi-programming systems?

User interaction loosely can be thought of as responding to a user's request while the machine is performing some work. Uni-programmed systems(in the older days) as the name suggests can perform only ...
user avatar
  • 345
3 votes
Accepted

Topological sort of minimum costs to finish interdependent tasks

I am assuming here that you are allowed to start tasks in parallel if there is no dependency between them, otherwise I think that no matter what order you do, the total time needed to finish the ...
user avatar
  • 1,403
3 votes

Topological sort of minimum costs to finish interdependent tasks

This problem is basically to find the longest path in a directed acyclic graph (DAG). Let $cost[t]$ be the number of days it takes to do task $t$. Let $m[t]$ be the minimum number of days to finish ...
user avatar
  • 34.1k

Top 50 recent answers are included