Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

One of my friends asked me about this today but I'm unsure the exact answer.

Assume we have a program that consists of different subprograms. Each subprogram has an input and an output, some subprograms' inputs can be other subprograms' outputs. We are able to use several processors to process the subprograms in parallel (each processor can process only 1 subprogram). The question is to describe this in terms of relations and how this relation helps with scheduling the subprograms.

For the first thought, I think this is all to do with transitive relations between the subprograms. But I'm not pretty sure about the explanation of how this relation helps with scheduling the subprograms.

I'm happy to discuss.

share|cite|improve this question

Write the relation $A < B$ if subprogram $B$ can't start until subprogram $A$ finishes (e.g. because program $A$'s output is an input to program $B$).

share|cite|improve this answer
I'm not quite understand what you mean by 'write a relation A<B'. – conbongu Oct 29 '11 at 2:21
Hmm.. just found that it's related to reachability relation. – conbongu Oct 29 '11 at 3:00

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.