Control of Fork-Join Processing Networks with Multiple Job Types and Parallel Shared Resources

A fork-join processing network is a queueing network in which tasks associated with a job can be processed simultaneously. Fork-join processing networks are prevalent in computer systems, healthcare, manufacturing, project management, justice systems, and so on. Unlike the conventional queueing networks, fork-join processing networks have synchronization constraints that arise because of the parallel processing of tasks and can cause significant job delays. We study scheduling in fork-join processing networks with multiple job types and parallel shared resources. Jobs arriving in the system fork into arbitrary number of tasks, then those tasks are processed in parallel, and then they join and leave the network. There are shared resources processing multiple job types. We study the scheduling problem for those shared resources (i.e., which type of job to prioritize at any given time) and propose an asymptotically optimal scheduling policy in diffusion scale.

On the Optimal Control of Parallel Processing Networks with Resource Collaboration and Multitasking

We study scheduling control of parallel processing networks in which some resources need to simultaneously collaborate to perform some activities and some resources multitask. Resource collaboration and multitasking give rise to synchronization constraints in resource scheduling when the resources are not divisible, that is, when the resources cannot be split. The synchronization constraints affect the system performance significantly. For example, because of those constraints, the system capacity can be strictly less than the capacity of the bottleneck resource. Furthermore, the resource scheduling decisions are not trivial under those constraints. For example, not all static prioritization policies retain the maximum system capacity, and the ones that retain the maximum system capacity do not necessarily minimize the delay (or, in general, the holding cost). We study optimal scheduling control of a class of parallel networks and propose a dynamic prioritization policy that retains the maximum system capacity and is asymptotically optimal in diffusion scale and a conventional heavy-traffic regime with respect to the expected discounted total holding cost objective.

Collapse and Measures of Consciousness

There has been an upsurge of interest lately in developing Wigner’s hypothesis that conscious observation causes collapse by exploring dynamical collapse models in which some purportedly quantifiable aspect(s) of consciousness resist superposition. Kremnizer–Ranchin, Chalmers–McQueen and Okon–Sebastián have explored the idea that collapse may be associated with a numerical measure of consciousness. More recently, Chalmers–McQueen have argued that any single measure is inadequate because it will allow superpositions of distinct states of equal consciousness measure to persist. They suggest a satisfactory model needs to associate collapse with a set of measures quantifying aspects of consciousness, such as the “Q-shapes” defined by Tononi et al. in their “integrated information theory” (IIT) of consciousness. I argue here that Chalmers–McQueen’s argument against associating a single measure with collapse requires a precise symmetry between brain states associated with different experiences and thus does not apply to the only case where we have strong intuitions, namely human (or other terrestrial biological) observers. In defence of Chalmers–McQueen’s stance, it might be argued that idealized artificial information processing networks could display such symmetries. However, I argue that the most natural form of any theory (such as IIT) that postulates a map from network states to mind states is one that assigns identical mind states to isomorphic network states (as IIT does). This suggests that, if such a map exists, no familiar components of mind states, such as viewing different colours, or experiencing pleasure or pain, are likely to be related by symmetries.