 Using a single traditional gang scheduling algorithm cannot provide the best performance for all workloads and parallel architectures. A solution for this problem is the use of an algorithm that is capable of dynamically changing its form (configuration) into a more appropriate one, according to environment variations and user requirements. In this paper, we propose, implement and analyze the...

The explosive growth of user data on the Internet has introduced significant security threats. In recent years, large data breaches and malicious content distribution (spam, malware) become prevalent. With the rapid adoption of mobile and wearable devices, user data now includes a wide range of personal mobile and physical data. It ranges from GPS location traces, to biometrics data, to user in...

This study aimed to investigate the effect of two different gang-lines on pulling angle sled dogs. It was hypothesised that dogs would run with a straighter pull (in relation main-line) in stick (STICK) than they do traditional (TRAD). Eight dogs, divided into teams, ran 3.1 km trail twice both types gang-lines, quadbike dry ground. Each dog remained its team same position (side gang line, and ...

Social media connects youth to peers who share shared experiences and support; however, urban gang-involved youth navigate ‘the digital street’ following a script that may incite violence. Urban gang-involved youth use SNS to brag and insult and make threats a concept known as Internet banging. Recent research suggests Internet banging has resulted in serious injury and homicide. We argue viole...

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...