LsnMaxMultiplicityKt

All Implemented Interfaces:


public final class LsnMaxMultiplicityKt

Nested Class Summary

Nested Classes
Modifier and Type	Class	Description

Field Summary

Fields
Modifier and Type	Field	Description

Constructor Summary

Constructors
Constructor	Description

Enum Constant Summary

Enum Constants
Enum Constant	Description

Method Summary

Modifier and Type	Method	Description
`final static Matrix`	`lsnMaxMultiplicity(LayeredNetworkStruct lsn)`	Computes the maximum multiplicity (number of concurrent instances) that can be sustained by each task in a layered network while respecting capacity constraints.

Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

- Constructor Detail
- Method Detail
  - lsnMaxMultiplicity
```
 final static Matrix lsnMaxMultiplicity(LayeredNetworkStruct lsn)
```
    Computes the maximum multiplicity (number of concurrent instances) that can be sustained by each task in a layered network while respecting capacity constraints.
    This function uses flow analysis based on Kahn's topological sorting algorithm to determine the maximum sustainable throughput for each task, considering both the incoming flow and the multiplicity constraints.
    
    Parameters:
    
    lsn - The layered network structure containing task dependencies and constraints
    
    Returns:
    
    Matrix of maximum multiplicities for each task in the network