This paper describes a tiling technique that can be used by application programmers and optimizing compilers to obtain I/O-efficient versions of regular scientific loop nests. Du...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
We present a method by which any polynomial-time randomized distributed algorithm is transformed in such way that each participating process needs only polylog local random bits a...
Several methods have been proposed for handling nonlinear constraints by evolutionary algorithms for numerical optimization problems; a survey paper [7] provides an overview of var...
Two novel suboptimal algorithms for mutual exclusion in distributed systems are presented. One is based on the modi cation of Maekawa's grid based quorum scheme. The size of ...
- Poor data in information systems impede the quality of decision-making in many modern organizations. Manual business process activities and application services are never execute...