File: PalemSimons.sig

package info (click to toggle)
mlton 20210117%2Bdfsg-3
  • links: PTS, VCS
  • area: main
  • in suites: sid
  • size: 58,464 kB
  • sloc: ansic: 27,682; sh: 4,455; asm: 3,569; lisp: 2,879; makefile: 2,347; perl: 1,169; python: 191; pascal: 68; javascript: 7
file content (17 lines) | stat: -rw-r--r-- 556 bytes parent folder | download | duplicates (5) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
 
(*
 * This algorithm is in Krishna and Barbara Simons' paper from TOPLAS '93.
 * Note: the dag is assumed to be in transitively closed form.
 * 
 * -- Allen
 *)
signature PALEM_SIMONS =
sig

   val rank : { dag : ('n,'e,'g) Graph.graph, (* dag *)
                l   : 'e Graph.edge -> int,   (* latency *)
                d   : 'n Graph.node -> int,   (* individual deadlines *)
                m   : int                     (* number of processors *)
              } -> 
              { d'  : int Array.array (* modified deadlines *)
              }
end