Gang scheduling provides shorter response time and enables interactive parallel programming. To utilize processor resources on interactive parallel programs, global state of distributed parallel processes should be detected. This problem is well-known as \distributed termination problem." In this paper, we propose a practical method to detect a global state of distributed processes. There are t...

Territorial animals and street gangs exhibit similar behavioral characteristics. Both organize themselves around a home base and mark their territories to distinguish claimed regions. Moorcroft et al. model the formation of territories and spatial distributions of coyote packs and their markings in [24]. We modify this approach to simulate gang dynamics in the Hollenbeck policing division of ea...

In this paper we study the performance of a distributed system that is subject to hardware failures and subsequent repairs. A special type of scheduling called gang scheduling is considered, under which jobs consist of a number of interacting tasks which are scheduled to run simultaneously on distinct processors. Two different gang scheduling policies used to schedule parallel jobs are examined...

Gang scheduling has recently been shown to be an effective task scheduling policy for parallel computers because it combines elements of space sharing and time sharing [10, 20]. In this paper, we propose new policies to enable gang scheduling to adapt to environments with real-time constraints. Our work, to our best knowledge, is the first attempt to address these real-time aspects with gang sc...

This paper explores the role of local structural conditions that facilitate or hinder violence when enmity is present between parties. This is illustrated by examining violence among street gangs. Using structural balance theory, the current research investigates whether certain triadic structures in which two rival gangs i and j are related to a third gang with either an ally or rival relation...

Territorial behavior is often found in nature. Coyotes and wolves organize themselves around a den site and mark their territory to distinguish their claimed region. Moorcroft et al. model the formation of territories and spatial distributions of coyote packs and their markings in [33]. We modify this ecological approach to simulate spatial gang dynamics in the Hollenbeck policing division of e...

In this paper we study the performance of parallel job scheduling in a distributed system. A special type of scheduling called gang scheduling is considered. In gang scheduling jobs consist of a number of interacting tasks, which are scheduled to run simultaneously on distinct processors. Two gang scheduling policies are used to schedule parallel jobs for two different types of job parallelism....

Parallel job scheduling is an important problem whose solution may lead to better utilization of modern parallel computers. It is de ned as : Given the aggregate of all tasks of multiple jobs in a parallel system, nd a spatial and temporal allocation to execute all tasks e ciently . For the purposes of scheduling, we view a computer as a queueing system. An arriving job may wait for some time, ...