TGFF: task graphs for free

  • Dick R
  • Rhodes D
  • Wolf W
  • 72

    Readers

    Mendeley users who have this article in their library.
  • 617

    Citations

    Citations of this article.

Abstract

We present a user-controllable, general-purpose, pseudorandom task graph generator called Task Graphs For Free (TGFF). TGFF creates problem instances for use in allocation and scheduling research. It has the ability to generate independent tasks as well as task sets which are composed of partially ordered task graphs. A complete description of a scheduling problem instance is created, including attributes for processors, communication resources, tasks, and inter-task communication. The user may parametrically control the correlations between attributes. Sharing TGFF's parameter settings allows researchers to easily reproduce the examples used by others, regardless of the platform on which TGFF is run

Author-supplied keywords

  • Communication system control
  • Databases
  • Digital circuits
  • Embedded system
  • Job shop scheduling
  • Operating systems
  • Processor scheduling
  • Real time systems
  • Resource management
  • Scheduling algorithm
  • TGFF
  • Task Graphs For Free
  • allocation
  • communication resources
  • graphs
  • processor scheduling
  • pseudorandom task graph generator
  • scheduling

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Robert P. Dick

  • David L. Rhodes

  • Wolf Wolf

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free