Alexandre Brandwajn

Learn More
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in(More)
A queueing network model of a time-sharing multiprogramming virtual memory system is presented including the effect of memory sharing among processes. An approximate explicit solution is obtained using equivalence and decomposition methods. The influence of system and program behaviour parameters on system performance (mean response time and CPU(More)
Current computer systems and communication networks tend to be highly complex, and they typically hide their internal structure from their users. Thus, for selected aspects of capacity planning, overload control and related applications, it is useful to have a method allowing one to find good and relatively simple approximations for the observed system(More)
In topology-based localization, each node in a network computes its hop-count distance to a finite number of reference nodes, or “landmarks”. This paper studies the impact of landmark placement on the accuracy of the resulting coordinate systems. The coordinates of each node are given by the hop-count distance to the landmarks. We show analytically that(More)
We present a queueing network model of a virtual memory computer system including the effect of memory sharing among processes. Page fault and file request system overheads are explicitly taken into account. The fact that some memory pages have to be saved in the secondary memory at the moment of a page fault, is also taken into consideration. We obtain an(More)
In the SCSI-2 standard, the unique IDs of devices on the bus define a fixed priority whenever several devices compete for the use of the bus. Although the more recent SCSI-3 standard specifies an additional fair arbitration mode, it leaves such fair mode an optional feature. Despite a number of allusions to potential unfairness of the traditional SCSI bus(More)
Following up on a recently renewed interest in computational methods for M /G/1-type processes, this paper considers an M /G/1-like system in which the service time distribution is represented by a Coxian series of memoryless stages. We present a novel approach to the solution of such systems. Our method is based on conditional probabilities, and provides a(More)
In this paper we consider a multi-server queue with a near general arrival process (represented as an arbitrary state-dependent Coxian distribution), a near general state-dependent Coxian service time distribution and a possibly finite queueing room. In addition to the dependence on the current number of customers in the system, the rate of arrivals and the(More)