In this paper we consider the distributed simulation of queueing networks of FCFS servers with infinite buffers, and irreducible Markovian routing. We first show that for either t...
Concept analysis transforms any relation between ‘lobjects” and “attributes” into a complete lattice. This concept lattice can be studied by algebraic means and offers rem...
The task of mappingbetween source programs and machine code, once the code has been optimizedand transformed by a compiler is often di cult. Yet there are many instances, such as ...
In conventional superscalar microarchitectures with partitioned integer and floating-point resources, all floating-point resources are idle during execution of integer programs....
S. Subramanya Sastry, Subbarao Palacharla, James E...
This paper describes a new public-key cryptosystem based on the hardness of computing higher residues modulo a composite RSA integer. We introduce two versions of our scheme, one d...