IEEE Transactions on Computers

Issue 10 • Oct 1990

Filter Results

Displaying Results 1 - 10 of 10
  • Adaptive optimal load balancing in a nonhomogeneous multiserver system with a central job scheduler

    Publication Year: 1990, Page(s):1232 - 1250
    Cited by:  Papers (58)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1212 KB)

    A model comprising several servers, each equipped with its own queue and with possibly different service speeds, is considered. Each server receives a dedicated arrival stream of jobs; there is also a stream of generic jobs that arrive to a job scheduler and can be individually allocated to any of the servers. It is shown that if the arrival streams are all Poisson and all jobs have the same expon... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Higher radix square rooting

    Publication Year: 1990, Page(s):1220 - 1231
    Cited by:  Papers (24)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (972 KB)

    A general discussion on nonrestoring square root algorithms is presented, showing bounds and constraints delimiting the space of feasible algorithms, for all the choices of radix, digit set and representation of the partial remainder. Two classes of algorithms are then derived from the general discussion, and it is shown how it is possible to determine two parameters with a relevant impact on the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An optimal algorithm for detecting weak visibility of a polygon

    Publication Year: 1990, Page(s):1213 - 1219
    Cited by:  Papers (17)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB)

    Notation and a theorem are presented which, using a result of B. Chazelle and L.J. Guibas (1985), enable the authors to design an O (n log n) algorithm for reporting all visibility edges of a given n-vertex polygon. Improving on this bound to O(n) is presently focused upon. This problem is solved for polygons with at least one given visibility ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computing cumulative measures of stiff Markov chains using aggregation

    Publication Year: 1990, Page(s):1291 - 1298
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (792 KB)

    An aggregation method for computing transient cumulative measures of large, stiff Markov models is presented. The method is based on classifying the states of the original problem into slow, fast-transient, and fast-current states. The authors aggregate fast-transient states and fast-recurrent states so that an approximate value to the desired cumulative measure can be obtained by solving a nonsti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A characterization of t/s-diagnosability and sequential t-diagnosability in designs

    Publication Year: 1990, Page(s):1298 - 1304
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (680 KB)

    A multiprocessing system is t/s-diagnosable if all faulty processors can be identified to within s processors, provided there are no more than t faulty processors. A characterization theorem of S. Karunanithi and A.D. Friedman (1979) for t/s-diagnosability in certain special cases of systems called designs is extended to the entire class of View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of detection probability and some applications

    Publication Year: 1990, Page(s):1284 - 1291
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (772 KB)

    Test-pattern generation for high fault coverage is an expensive and time-consuming process. As an alternative circuits can be tested by applying random or pseudorandom patterns. To analyze random testing without fault simulation, the number of vectors that detect a fault in each fault class must be enumerated. A fault-detection function whose number of minterms is identical to the fault detectabil... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performability analysis using semi-Markov reward processes

    Publication Year: 1990, Page(s):1251 - 1264
    Cited by:  Papers (59)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1048 KB)

    M.D. Beaudry (1978) proposed a simple method of computing the distribution of performability in a Markov reward process. Two extensions of Beaudry's approach are presented. The authors generalize the method to a semi-Markov reward process by removing the restriction requiring the association of zero reward to absorbing states only. The algorithm proceeds by replacing zero reward nonabsorbing state... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithm-based fault detection for signal processing applications

    Publication Year: 1990, Page(s):1304 - 1308
    Cited by:  Papers (116)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (500 KB)

    The increasing demands for high-performance signal processing along with the availability of inexpensive high-performance processors have results in numerous proposals for special-purpose array processors for signal processing applications. A functional-level concurrent error-detection scheme is presented for such VLSI signal processing architectures as those proposed for the FFT and QR f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Searching on a tape

    Publication Year: 1990, Page(s):1265 - 1272
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (612 KB)

    The problem of minimizing the average time to search for a key in a stored list of keys in a sequential access machine model (SAM) (e.g. a magnetic tape) is considered. The time to access a key in the list and the time to compare it to the given search key are taken into account. The time to access a key in the list is assumed proportional to the distance the head moves from its current location t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cellular automata-based signature analysis for built-in self-test

    Publication Year: 1990, Page(s):1273 - 1283
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB)

    Relevant signature analysis properties for elementary one-dimensional cellular automata are presented. It is found that cellular automata with cyclic-group rules provide signature analysis properties comparable to the LFSR (linear feedback shift register). A technique of using CALBO (cellular automata-based logic block observation) for both test pattern generation and signature analysis, in a simi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

Aims & Scope

The IEEE Transactions on Computers is a monthly publication with a wide distribution to researchers, developers, technical managers, and educators in the computer field.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Paolo Montuschi
Politecnico di Torino
Dipartimento di Automatica e Informatica
Corso Duca degli Abruzzi 24 
10129 Torino - Italy
e-mail: pmo@computer.org