Classical UTIL propagation protocol. More...

Inheritance diagram for frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >:

[legend]

Classes
class	SolutionMessage
	A message holding the optimal assignments to variables, conditioned on the assignments to the variables in its separator. More...
class	SeparatorMessage
	A message holding the separator of a given child variable. More...
class	OptUtilMessage
	Message sent by roots containing the optimal utility value of their DFS tree. More...
class	StatsMessage
	Message containing statistics. More...
class	ClusterInfo
	A convenience class used to store information about a cluster. More...

Public Member Functions
MessageType	getStartMsgType ()
MessageType	getDFSMsgType ()
	UTILpropagation ()
	Default constructor.
	UTILpropagation (DCOPProblemInterface< Val, U > problem)
	Constructor.
	UTILpropagation (DCOPProblemInterface< Val, U > problem, Element parameters)
	Constructor from XML descriptions.
void	reset ()
	UTILpropagation (Element parameters, DCOPProblemInterface< Val, U > problem)
	The constructor called in "statistics gatherer" mode.
Collection< MessageType >	getMsgTypes ()
void	notifyIn (Message msg)
	The algorithm.
void	setQueue (Queue queue)
void	getStatsFromQueue (Queue queue)
void	setSilent (boolean silent)
Integer	getMaxMsgDim ()
U	getOptUtil ()
long	getFinalTime ()
	Returns the time at which this module has finished, determined by looking at the timestamp of the stat messages.
Public Member Functions inherited from frodo2.communication.IncomingMsgPolicyInterface< T >
default void	notifyIn (Message msg, Object toAgent)
	Notifies the listener of an incoming message.

Static Public Attributes
static MessageType	START_MSG_TYPE = AgentInterface.START_AGENT
	The type of the message telling the module to start.
static MessageType	FINISH_MSG_TYPE = AgentInterface.AGENT_FINISHED
	The type of the message telling the agent finished.
static MessageType	DFS_MSG_TYPE = DFSgeneration.OUTPUT_MSG_TYPE
	The type of the messages containing information about the DFS.
static final MessageType	UTIL_MSG_TYPE = new MessageType ("DPOP", "UTILpropagation", "UTIL")
	The type of the messages containing utilities.
static final MessageType	OUTPUT_MSG_TYPE = new MessageType ("DPOP", "UTILpropagation", "UTILoutput")
	The type of the messages containing conditional optimal assignments.
static final MessageType	SEPARATOR_MSG_TYPE = new MessageType ("DPOP", "UTILpropagation", "Separator")
	The type of the messages containing separators.
static final MessageType	OPT_UTIL_MSG_TYPE = new MessageType ("DPOP", "UTILpropagation", "OptUtil")
	The type of the messages containing optimal utility values sent by roots.
static final MessageType	UTIL_STATS_MSG_TYPE = new MessageType ("DPOP", "UTILpropagation", "UTILstats")
	The type of messages sent to the statistics monitor.

Protected Member Functions
void	init ()
	Parses the problem.
ClusterInfo	newClusterInfo ()
void	sendSeparator (String senderVar, String senderAgent, String dest, String[] separator)
	Sends a message to the VALUEpropagation module containing the separator of a variable.
void	record (String senderVar, UtilitySolutionSpace< Val, U > space, ClusterInfo info)
	Records the input space until spaces from all children have been received.
void	projectAndSend (ClusterInfo info)
	Projects out a variable and sends the result to its parent (if any) or to itself (to initiate VALUE propagation).
ProjOutput< Val, U >	project (UtilitySolutionSpace< Val, U > space, String[] vars)
	Projects the input variable from the input space.
void	sendToParent (String var, String parentVar, String parentAgent, UtilitySolutionSpace< Val, U > space)
	Sends a UTIL message.
void	sendOutput (UtilitySolutionSpace< Val, U > space, String root)
	Sends the output optimal utility to itself (i.e.

Protected Attributes
boolean	withAnonymVars = false
	Whether the parser should consider variables with no specified owner.
DCOPProblemInterface< Val, U >	problem
	The problem.
boolean	started = false
	Whether the execution of the algorithm has been started.
boolean	maximize = true
	`true` if we want to maximize utility, `false` if we want to minimize cost
Queue	queue
	The queue on which it should call sendMessage().
Map< String, ClusterInfo >	infos
	For each variable this agent owns, its relevant information.
String	myID
	This agent's name.
U	optUtil
	The optimal utility found to the problem.
boolean	reportStats = true
	Whether to report stats.

Private Attributes
long	finalTime
	The time when the last stat message has been received.
Integer	maxMsgDim = 0
	In stats gatherer mode, the maximum number of variables in a UTIL message.
final boolean	minNCCCs
	Whether to minimize the NCCC count, at the expense of an increase in runtime.

Detailed Description

Classical UTIL propagation protocol.

Author: Thomas Leaute

Parameters

<Val>	type used for variable values
<U>	type used for utility values

Constructor & Destructor Documentation

◆ UTILpropagation() [1/4]

frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.UTILpropagation ( )

Default constructor.

◆ UTILpropagation() [2/4]

frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.UTILpropagation ( DCOPProblemInterface< Val, U > problem )

Constructor.

Parameters

problem the problem description

References problem.

◆ UTILpropagation() [3/4]

frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >.UTILpropagation	(	DCOPProblemInterface< Val, U >	problem,
		Element	parameters )

Constructor from XML descriptions.

Parameters

problem	description of the problem
parameters	description of the parameters of UTILpropagation

References problem.

◆ UTILpropagation() [4/4]

frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >.UTILpropagation	(	Element	parameters,
		DCOPProblemInterface< Val, U >	problem )

The constructor called in "statistics gatherer" mode.

Parameters

problem	the overall problem
parameters	the description of what statistics should be reported (currently unused)

References problem.

Member Function Documentation

◆ getDFSMsgType()

MessageType frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.getDFSMsgType ( )

Returns: the type of the DFS output

Reimplemented in frodo2.algorithms.dpop.memory.MemoryBoundedUTIL< V extends Addable< V >, U extends Addable >.

References DFS_MSG_TYPE.

Referenced by getMsgTypes().

◆ getFinalTime()

long frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.getFinalTime ( )

Returns the time at which this module has finished, determined by looking at the timestamp of the stat messages.

Author: Brammert Ottens, 22 feb 2010

Returns: the time at which this module has finished

References finalTime.

◆ getMaxMsgDim()

Integer frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.getMaxMsgDim ( )

Returns: the maximum number of variables in a UTIL message (in stats gatherer mode only)

◆ getMsgTypes()

Collection< MessageType > frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.getMsgTypes ( )

See also: StatsReporter.getMsgTypes()

Implements frodo2.communication.MessageListener< T >.

Reimplemented in frodo2.algorithms.dpop.memory.MemoryBoundedUTIL< V extends Addable< V >, U extends Addable >, and frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable >.

References FINISH_MSG_TYPE, getDFSMsgType(), getStartMsgType(), and UTIL_MSG_TYPE.

Here is the call graph for this function:

◆ getOptUtil()

U frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.getOptUtil ( )

Returns: the optimal utility found to the problem

Warning: Only works if the module is instantiated in stats gatherer mode.

Referenced by frodo2.algorithms.dpop.test.DPOPagentTest< V extends Addable< V >, U extends Addable >.checkOutput().

◆ getStartMsgType()

MessageType frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.getStartMsgType ( )

Returns: the type of the start message

Reimplemented in frodo2.algorithms.dpop.memory.MemoryBoundedUTIL< V extends Addable< V >, U extends Addable >.

References START_MSG_TYPE.

Referenced by getMsgTypes().

◆ getStatsFromQueue()

void frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.getStatsFromQueue ( Queue queue )

See also: StatsReporter.getStatsFromQueue(Queue)

Implements frodo2.algorithms.StatsReporter.

Reimplemented in frodo2.algorithms.dpop.param.ParamUTIL< Val extends Addable< Val >, U extends Addable >, frodo2.algorithms.dpop.stochastic.CompleteUTIL< Val extends Addable< Val >, U extends Addable >, and frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable >.

References OPT_UTIL_MSG_TYPE, queue, and UTIL_STATS_MSG_TYPE.

◆ init()

void frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.init ( )

protected

Parses the problem.

Reimplemented in frodo2.algorithms.dpop.stochastic.CompleteUTIL< Val extends Addable< Val >, U extends Addable >.

References problem.

Referenced by frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable >.notifyIn().

◆ newClusterInfo()

ClusterInfo frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.newClusterInfo ( )

protected

Returns: a new ClusterInfo

Reimplemented in frodo2.algorithms.dpop.memory.MemoryBoundedUTIL< V extends Addable< V >, U extends Addable >.

◆ notifyIn()

void frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.notifyIn ( Message msg )

The algorithm.

For each variable that it owns, the agent waits for the reception of all UTIL messages from all child variables.

Parameters

msg	the message received

Implements frodo2.communication.IncomingMsgPolicyInterface< T >.

Reimplemented in frodo2.algorithms.dpop.memory.MemoryBoundedUTIL< V extends Addable< V >, U extends Addable >, frodo2.algorithms.dpop.param.ParamUTIL< Val extends Addable< Val >, U extends Addable >, frodo2.algorithms.dpop.stochastic.CompleteUTIL< Val extends Addable< Val >, U extends Addable >, and frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable >.

References frodo2.communication.MessageType.equals(), finalTime, notifyIn(), OPT_UTIL_MSG_TYPE, and queue.

Referenced by notifyIn().

Here is the call graph for this function:

◆ project()

ProjOutput< Val, U > frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >.project	(	UtilitySolutionSpace< Val, U >	space,
		String[]	vars )

protected

Projects the input variable from the input space.

Parameters

space	the space
vars	the variables to project out

Returns: the result of the projection

Reimplemented in frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable >, and frodo2.algorithms.dpop.stochastic.robust.WorstCaseUTIL< Val extends Addable< Val >, U extends Addable >.

References maximize, and frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable >.project().

Referenced by frodo2.algorithms.dpop.memory.MemoryBoundedUTIL< V extends Addable< V >, U extends Addable >.projectAndSend().

Here is the call graph for this function:

◆ projectAndSend()

void frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.projectAndSend ( ClusterInfo info )

protected

Projects out a variable and sends the result to its parent (if any) or to itself (to initiate VALUE propagation).

Parameters

info	information about the variable to be projected out

Reimplemented in frodo2.algorithms.dpop.memory.MemoryBoundedUTIL< V extends Addable< V >, U extends Addable >, and frodo2.algorithms.dpop.stochastic.CompleteUTIL< Val extends Addable< Val >, U extends Addable >.

References frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable >.join(), projectAndSend(), and queue.

Referenced by frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable >.notifyIn(), and projectAndSend().

Here is the call graph for this function:

◆ record()

void frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >.record	(	String	senderVar,
		UtilitySolutionSpace< Val, U >	space,
		ClusterInfo	info )

protected

Records the input space until spaces from all children have been received.

Parameters

senderVar	the sender variable; `null` if the space is a local constraint
space	the space to be recorded
info	the information on the variable responsible for the space

Todo: Use the MessageWithRawData paradigm to deserialize the biggest space first, and then deserialize the smaller spaces on-the-fly into the biggest space (when they are subspaces of it) to save memory

Reimplemented in frodo2.algorithms.dpop.stochastic.CompleteUTIL< Val extends Addable< Val >, U extends Addable >.

References frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.ClusterInfo.spaces.

◆ reset()

void frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.reset ( )

See also: StatsReporter.reset()

Implements frodo2.algorithms.StatsReporter.

Reimplemented in frodo2.algorithms.dpop.param.ParamUTIL< Val extends Addable< Val >, U extends Addable >, and frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable >.

◆ sendOutput()

void frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >.sendOutput	(	UtilitySolutionSpace< Val, U >	space,
		String	root )

protected

Sends the output optimal utility to itself (i.e.

the VALUEpropagation listener) and to the statistics monitor

Parameters

space	the final frontier
root	the root of the DFS

Reimplemented in frodo2.algorithms.dpop.param.ParamUTIL< Val extends Addable< Val >, U extends Addable >, frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable >, and frodo2.algorithms.dpop.stochastic.robust.WorstCaseUTIL< Val extends Addable< Val >, U extends Addable >.

References infos, frodo2.output, queue, and frodo2.algorithms.AgentInterface< V extends Addable< V > >.STATS_MONITOR.

◆ sendSeparator()

void frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >.sendSeparator	(	String	senderVar,
		String	senderAgent,
		String	dest,
		String[]	separator )

protected

Sends a message to the VALUEpropagation module containing the separator of a variable.

Parameters

senderVar	sender variable
senderAgent	sender agent
dest	destination variable
separator	the separator of the destination variable

Reimplemented in frodo2.algorithms.dpop.memory.MemoryBoundedUTIL< V extends Addable< V >, U extends Addable >, and frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable >.

References queue.

◆ sendToParent()

void frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >.sendToParent	(	String	var,
		String	parentVar,
		String	parentAgent,
		UtilitySolutionSpace< Val, U >	space )

protected

Sends a UTIL message.

Parameters

var	the sender of the message
parentVar	the destination variable of the message
parentAgent	the destination agent of the message
space	the content of the message

Todo: First try to prune variable domains, and notify other branches of the pseudo-tree of the pruning.

Reimplemented in frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable >, and frodo2.algorithms.dpop.stochastic.robust.WorstCaseUTIL< Val extends Addable< Val >, U extends Addable >.

References infos, queue, and frodo2.algorithms.AgentInterface< V extends Addable< V > >.STATS_MONITOR.

◆ setQueue()

void frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.setQueue ( Queue queue )

See also: StatsReporter.setQueue(Queue)

Implements frodo2.communication.MessageListener< T >.

References queue.

◆ setSilent()

void frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.setSilent ( boolean silent )

See also: StatsReporter.setSilent(boolean)

Implements frodo2.algorithms.StatsReporter.

Member Data Documentation

◆ DFS_MSG_TYPE

MessageType frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.DFS_MSG_TYPE = DFSgeneration.OUTPUT_MSG_TYPE

static

The type of the messages containing information about the DFS.

Referenced by getDFSMsgType().

◆ finalTime

long frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.finalTime

private

The time when the last stat message has been received.

Referenced by getFinalTime(), and notifyIn().

◆ FINISH_MSG_TYPE

MessageType frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.FINISH_MSG_TYPE = AgentInterface.AGENT_FINISHED

static

The type of the message telling the agent finished.

Referenced by getMsgTypes().

◆ infos

Map<String, ClusterInfo> frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.infos

protected

For each variable this agent owns, its relevant information.

Referenced by frodo2.algorithms.dpop.memory.MemoryBoundedUTIL< V extends Addable< V >, U extends Addable >.notifyIn(), frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable >.notifyIn(), sendOutput(), and sendToParent().

◆ maximize

boolean frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.maximize = true

protected

true if we want to maximize utility, false if we want to minimize cost

Referenced by frodo2.algorithms.dpop.param.ParamUTIL< Val extends Addable< Val >, U extends Addable >.notifyIn(), frodo2.algorithms.dpop.stochastic.CompleteUTIL< Val extends Addable< Val >, U extends Addable >.notifyIn(), frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable >.notifyIn(), frodo2.algorithms.dpop.stochastic.CompleteUTIL< Val extends Addable< Val >, U extends Addable >.project(), frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable >.project(), frodo2.algorithms.dpop.stochastic.robust.WorstCaseUTIL< Val extends Addable< Val >, U extends Addable >.project(), and project().

◆ maxMsgDim

Integer frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.maxMsgDim = 0

private

In stats gatherer mode, the maximum number of variables in a UTIL message.

◆ minNCCCs

final boolean frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.minNCCCs

private

Whether to minimize the NCCC count, at the expense of an increase in runtime.

◆ myID

String frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.myID

protected

This agent's name.

Referenced by frodo2.algorithms.dpop.memory.MemoryBoundedUTIL< V extends Addable< V >, U extends Addable >.projectAndSend().

◆ OPT_UTIL_MSG_TYPE

final MessageType frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.OPT_UTIL_MSG_TYPE = new MessageType ("DPOP", "UTILpropagation", "OptUtil")

static

The type of the messages containing optimal utility values sent by roots.

Referenced by frodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable >.getMsgTypes(), frodo2.algorithms.dpop.privacy.VariableObfuscation< V extends Addable< V >, U extends Addable >.getMsgTypes(), frodo2.algorithms.dpop.test.VALUEpropagationTest >.Listener.getMsgTypes(), getStatsFromQueue(), frodo2.algorithms.dpop.test.UTILpropagationTest >.Listener.Listener(), frodo2.algorithms.dpop.stochastic.CompleteUTIL< Val extends Addable< Val >, U extends Addable >.notifyIn(), frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable >.notifyIn(), frodo2.algorithms.dpop.test.VALUEpropagationTest >.Listener.notifyIn(), notifyIn(), and frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.OptUtilMessage >.OptUtilMessage().

◆ optUtil

U frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.optUtil

protected

The optimal utility found to the problem.

Referenced by frodo2.algorithms.dpop.stochastic.CompleteUTIL< Val extends Addable< Val >, U extends Addable >.notifyIn(), and frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable >.notifyIn().

◆ OUTPUT_MSG_TYPE

final MessageType frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.OUTPUT_MSG_TYPE = new MessageType ("DPOP", "UTILpropagation", "UTILoutput")

static

The type of the messages containing conditional optimal assignments.

Referenced by frodo2.algorithms.dpop.param.ParamVALUE< Val extends Addable< Val > >.getMsgTypes(), frodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable >.getMsgTypes(), frodo2.algorithms.dpop.stochastic.test.ExpectedUTILtest.Listener.getMsgTypes(), frodo2.algorithms.dpop.param.ParamVALUE< Val extends Addable< Val > >.notifyIn(), frodo2.algorithms.dpop.stochastic.test.ExpectedUTILtest.Listener.notifyIn(), and frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.SolutionMessage< Val extends Addable< Val > >.SolutionMessage().

◆ problem

DCOPProblemInterface<Val, U> frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.problem

protected

The problem.

◆ queue

Queue frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.queue

protected

The queue on which it should call sendMessage().

◆ reportStats

boolean frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.reportStats = true

protected

Whether to report stats.

Referenced by frodo2.algorithms.dpop.param.ParamUTIL< Val extends Addable< Val >, U extends Addable >.notifyIn(), frodo2.algorithms.dpop.stochastic.CompleteUTIL< Val extends Addable< Val >, U extends Addable >.notifyIn(), frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable >.notifyIn(), frodo2.algorithms.dpop.memory.MemoryBoundedUTIL< V extends Addable< V >, U extends Addable >.projectAndSend(), and frodo2.algorithms.dpop.param.ParamUTIL< Val extends Addable< Val >, U extends Addable >.sendOutput().

◆ SEPARATOR_MSG_TYPE

final MessageType frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.SEPARATOR_MSG_TYPE = new MessageType ("DPOP", "UTILpropagation", "Separator")

static

The type of the messages containing separators.

Referenced by frodo2.algorithms.dpop.param.ParamVALUE< Val extends Addable< Val > >.getMsgTypes(), frodo2.algorithms.dpop.param.test.ParamUTILtest >.Listener.getMsgTypes(), frodo2.algorithms.dpop.test.UTILpropagationTest >.Listener.getMsgTypes(), frodo2.algorithms.dpop.test.UTILpropagationTest >.Listener.notifyIn(), and frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.SeparatorMessage.SeparatorMessage().

◆ START_MSG_TYPE

MessageType frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.START_MSG_TYPE = AgentInterface.START_AGENT

static

The type of the message telling the module to start.

Referenced by getStartMsgType().

◆ started

boolean frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.started = false

protected

Whether the execution of the algorithm has been started.

Referenced by frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable >.notifyIn().

◆ UTIL_MSG_TYPE

final MessageType frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.UTIL_MSG_TYPE = new MessageType ("DPOP", "UTILpropagation", "UTIL")

static

The type of the messages containing utilities.

Referenced by frodo2.algorithms.dpop.privacy.VariableObfuscation< V extends Addable< V >, U extends Addable >.getMsgTypes(), frodo2.algorithms.dpop.restart.UTILreuse.getMsgTypes(), frodo2.algorithms.dpop.stochastic.test.ExpectedUTILtest.Listener.getMsgTypes(), getMsgTypes(), frodo2.algorithms.dpop.restart.UTILreuse.notifyIn(), frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable >.notifyIn(), frodo2.algorithms.dpop.stochastic.test.ExpectedUTILtest.Listener.notifyIn(), frodo2.algorithms.dpop.restart.UTILreuse.notifyOut(), frodo2.algorithms.dpop.privacy.VariableObfuscation< V extends Addable< V >, U extends Addable >.sendDelayedMsg(), frodo2.algorithms.dpop.restart.test.TestSDPOP< V extends Addable< V >, U extends Addable >.testAddDisconnected(), frodo2.algorithms.dpop.restart.test.TestSDPOP< V extends Addable< V >, U extends Addable >.testReuse(), frodo2.algorithms.dpop.UTILmsg< Val extends Addable< Val >, U extends Addable >.UTILmsg(), and frodo2.algorithms.dpop.UTILmsg< Val extends Addable< Val >, U extends Addable >.UTILmsg().

◆ UTIL_STATS_MSG_TYPE

final MessageType frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.UTIL_STATS_MSG_TYPE = new MessageType ("DPOP", "UTILpropagation", "UTILstats")

static

The type of messages sent to the statistics monitor.

Referenced by frodo2.algorithms.dpop.param.ParamUTIL< Val extends Addable< Val >, U extends Addable >.getStatsFromQueue(), frodo2.algorithms.dpop.privacy.EncryptedUTIL< V extends Addable< V >, U extends Addable, E extends AddableLimited< U, E >.getStatsFromQueue(), getStatsFromQueue(), frodo2.algorithms.dpop.privacy.EncryptedUTIL< V extends Addable< V >, U extends Addable, E extends AddableLimited< U, E >.notifyIn(), and frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.StatsMessage.StatsMessage().

◆ withAnonymVars

boolean frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.withAnonymVars = false

protected

Whether the parser should consider variables with no specified owner.

Referenced by frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable >.ExpectedUTIL().

The documentation for this class was generated from the following file:

src/frodo2/algorithms/dpop/UTILpropagation.java

Classes

Public Member Functions

Static Public Attributes

Protected Member Functions

Protected Attributes

Private Attributes

Detailed Description

Constructor & Destructor Documentation

◆ UTILpropagation() [1/4]

◆ UTILpropagation() [2/4]

◆ UTILpropagation() [3/4]

◆ UTILpropagation() [4/4]

Member Function Documentation

◆ getDFSMsgType()

◆ getFinalTime()

◆ getMaxMsgDim()

◆ getMsgTypes()

◆ getOptUtil()

◆ getStartMsgType()

◆ getStatsFromQueue()

◆ init()

◆ newClusterInfo()

◆ notifyIn()

◆ project()

◆ projectAndSend()

◆ record()

◆ reset()

◆ sendOutput()

◆ sendSeparator()

◆ sendToParent()

◆ setQueue()

◆ setSilent()

Member Data Documentation

◆ DFS_MSG_TYPE

◆ finalTime

◆ FINISH_MSG_TYPE

◆ infos

◆ maximize

◆ maxMsgDim

◆ minNCCCs

◆ myID

◆ OPT_UTIL_MSG_TYPE

◆ optUtil

◆ OUTPUT_MSG_TYPE

◆ problem

◆ queue

◆ reportStats

◆ SEPARATOR_MSG_TYPE

◆ START_MSG_TYPE

◆ started

◆ UTIL_MSG_TYPE

◆ UTIL_STATS_MSG_TYPE

◆ withAnonymVars