In systems consisting of multiple clusters of processors such as our Distributed ASCI1 Supercomputer (DAS), jobs may request co-allocation, i.e., the simultaneous allocation of processors in different clusters. We simulate such systems ignoring communication among the tasks of jobs, and determine the response times for different types and sizes of job requests, and for different numbers and siz...

the critical part for building any software system is its architecture. Architectural design is a design at a higher level of abstraction. A good architecture ensures that software will satisfy its requirement. This paper defines the most important activities of architectural design that used through building any software; also it applies these activities on one type of Electronic Commerce(EC) ...

We present here a discipline for job shop reschedub ing based on partial order backtracking. We show that partial order backtracking offers the rescheduler a framework for schedule repair, based upon a set of nocdoods, which impose a systematic paxtial order on the set of activities to be repaired but allows non systematic techniques to be used within that framework. We present rescheduling as ...

Previous evidence regarding the outcomes of sexual harassment in the workplace has come mainly from self-selected samples or analogue studies or those using inadequate measures. The sexual harassment experiences, coping responses, and job-related and psychological outcomes of 447 female private-sector employees and 300 female university employees were examined. Discriminant function analyses in...

We present a new enhanced version for Adaptive Stable Sender-Symmetric Algorithm which efficiently allocates jobs in the network and possesses multiple job transfer capabilities. Till now, all the algorithms schedule only one job at a time to other nodes in a distributed system. We here present a mechanism that is able to schedule multiple jobs coming to a node to multiple nodes in the network ...

Two independent Poisson streams of jobs flow into a single-server service system having a limited common buffer that can hold at most one job. If a type-i job (i = 1, 2) finds the server busy, it is blocked and routed to a separate type-i retrial (orbit) queue that attempts to re-dispatch its jobs at its specific Poisson rate. This creates a system with three dependent queues. Such a queueing s...

We analyze the effects of adverse selection on worker turnover and wage dynamics in a frictional labor market. We consider a model of on-the-job search where firms offer promotion wage contracts to workers of different abilities, which is unknown to firms at the hiring stage. With sufficiently strong information frictions, low-wage firms offer separating contracts and hire all types of workers ...

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

This study examined age differences in topics that generate interpersonal tensions as well as relationship level characteristics that may account for variability in the content of interpersonal tensions. Participants aged 13 to 99 years (N = 184) diagramed their close and problematic social networks, and then provided open-ended descriptions of recent tensions with up to 6 social partners. Mult...

This paper describes an order release and loading technique, which considers the routing as well as the machine flexibility of a modern job shop production. The workload control approach involves three steps. In a first step 'lead orders', i.e. urgent production orders that are either processed on a known bottleneck or are of high value, are identified. Afterwards transfer batches of the lead p...