Cyclomatic Complexity

Cyclomatic Complexity
A software -complexity measure by finding the number of independent paths a program can follow during execution.

Software Complexity

Software Complexity
A quantitative indication of maximum algorithm size and its reliability and a complexity measure.

Software Engineering Services

Software Engineering Services
A Practice for using software engineering approach during the software development process.

Resynchronisation

Resynchronisation
Repeating synchronization by suitable mathematical analysis, reducing the number of IPCs and thus , the delays caused at the processors waiting for the IPCs , in a multiprocessor system.

Total Performance Cost

Total Performance Cost 
Total of all performance costs. This Will be the minimum if the load on the processors is balanced.

Performance cost

Performance cost 
Time taken for execution at a vertex or at a sub-graph or micro thread.

Micro Thread

Micro Thread
A set of instructions or controlled nesting structures in a thread that is the minimum that can be represented by an actor . Merging of micro threads into macro threads is used to minimize the performance cost.

Macro Thread

Macro Thread 
A thread or its part that has a number of processes and instructions threaded together.

Load Balancing

Load Balancing 
Partitioning and scheduling of micro threads and instructions such that each processor shares the processing load in a multiprocessor system.

Partitioning

Partitioning
Partitioning the graphs into parts, with each part scheduled on the processors as per scheduling strategy adopted.

Multi Thread Graph (MTG) System Model

Multi Thread Graph (MTG) System Model
A model in which there is task level concurrency between the different threads models by an FSM and the processor level concurrency models by timed Petri-nets.

Extended Predicate / Transition Net

Extended Predicate / Transition Net
Timed Petri-nets with delays represented by probabilistic distribution functions. 

Timed Petri-nets

Timed Petri-nets
Petri-net showing the transition firing times on the edges and fired computations times.

Scheduling

Scheduling 
Allocation of different vertices or sub-graphs on different processors.

APEG

APEG
SDFG with no delays.

HSDFG

HSDFG
Representation in which there is unfolding of the SDFG so that there is only one token, with its delay along its edge.

SDFG

SDFG
A DFG representation modified in which inputs delays are also shown. Circles are the actores where computations takes place like at Petri net transitions or at nodes in a DFG. Edge has dots for the delays and labels the number of inputs and outputs.