Fairness is one of the important notion for programming language, such as process algebras like CCS, that includes concurrency (or parallelism) and nondeterminism . This ensures that while repeatedly choosing among a set of alternatives, no alternative will be postponed forever. However, the fairness does not mention at what frequency these alternatives are selected. In this paper, we propose a...

This paper analyzes an M/M/2 queueing system with two heterogeneous servers. Both servers goes on vacation when there is no customers waiting for service after this server 1 is always available but the other goes on vacation whenever server 2 is idle. The vacationing server however, returns to serve at a low rate as an arrival finds the other server busy. The system is analyzed in the steady st...

Evaluating the reliability of loosely coupled Software as a Service through the paradigm of a cluster-based and non-cluster-based web server is considered to be an important attribute for the service delivery and execution. We proposed a novel method for measuring the reliability of Software as a Service execution through load testing. The fault count of the model against the stresses of users ...

The model is a service system, consisting of several large server pools. A server processing speed and buffer size (which may be finite or infinite) depend on the pool. The input flow of customers is split equally among a fixed number of routers, which must assign customers to the servers immediately upon arrival. We consider an asymptotic regime in which the customer total arrival rate and poo...

We consider a cluster of heterogeneous servers, modeled as M/G/1 queues with different processing speeds. The scheduling policies for these servers can be either processor-sharing or first-come first-serve. Furthermore, a dispatcher that assigns jobs to the servers takes as input only the size of the arriving job and the overall job-size distribution. This general model captures the behavior of...

The Fold and Function Assignment System (FFAS) server [Jaroszewski et al. (2005) FFAS03: a server for profile-profile sequence alignments. Nucleic Acids Research, 33, W284-W288] implements the algorithm for protein profile-profile alignment introduced originally in [Rychlewski et al. (2000) Comparison of sequence profiles. Strategies for structural predictions using sequence information. Protei...

The FFAS03 server provides a web interface to the third generation of the profile-profile alignment and fold-recognition algorithm of fold and function assignment system (FFAS) [L. Rychlewski, L. Jaroszewski, W. Li and A. Godzik (2000), Protein Sci., 9, 232-241]. Profile-profile algorithms use information present in sequences of homologous proteins to amplify the patterns defining the family. A...

acoustic experimental data of irib (islamic republic of iran broadcasting) server room was taken to measure the acoustic noise characteristics of frequency and sound pressure level (spl). the purposes of this paper are measuring the noise pollution and its evaluation through the regulations. the measurements were taken in two stages. the first one was taken at 10 points by sound investigator 22...

Continuity of stream playback is the crucial constraint in designing a continuous media server. From a distributed memory architectural model developed earlier, we found that there were many points where the stream capacity of the server could be improved. The stream capacity was usually limited by the storage bottlenecks. Serving streams from memory cache eliminates disk accesses and data tran...

Mobile crowd sensing is one of the most active areas of research. Participatory sensing is part of it in which participants sense their surroundings and collaborate to accomplish a given task. The participants in reference are smartphones. We focus on location dependent tasks and a problem of role assignment. An existing work on the same defines three types of roles for the participants: broadc...