Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
 
Bassiouni, M.
University of Central Florida
Orlando, Florida
  Follow this Reviewer
 
 
 
Options:
Date Reviewed  
 
1
- 10 of 10 reviews

   
  A new text compression technique based on language structure
Akman K. Journal of Information Science 21(2): 87-94, 1995.  Type: Article

A dictionary-based text compression algorithm specifically designed for the Turkish language is described. Words in Turkish are normally formed from a root and one or more suffixes, or from a root only. The algorithm uses three diction...

Aug 1 1996  
  Implementing multiple locks using Lamport’s mutual exclusion algorithm
Boehm H., Demers A., Uhler C. ACM Letters on Programming Languages and Systems 2(1-4): 46-58, 1993.  Type: Article

The implementation of spin locks using Lamport’s fast algorithm for mutual exclusion [1] is described. A straightforward implementation of Lamport’s algorithm would replicate all of its variables, including the Bool...

May 1 1995  
  Adaptable concurrency control for atomic data types
Atkins M., Coady M. ACM Transactions on Computer Systems 10(3): 190-225, 1992.  Type: Article

The implementation and performance evaluation of three concurrency control (CC) servers used to access a shared object type, called the semiqueue, within distributed systems are described. The first server uses a purely optimistic poli...

Mar 1 1994  
  Analysis of Hybrid Concurrency Control Schemes for a High Data Contention Environment
Yu P. (ed), Dias D. IEEE Transactions on Software Engineering 18(2): 118-129, 1992.  Type: Article

Analytical models for three hybrid concurrency control (CC) schemes are presented. The models are based on the “access invariance” property, that is, reruns of a transaction generally access the same granules refere...

Aug 1 1993  
  Performance Analysis of Dynamic Locking with the No-Waiting Policy
Ryu I., Thomasian A. IEEE Transactions on Software Engineering 16(7): 684-698, 1990.  Type: Article

The DLNW-R (Dynamic Locking with No-Waiting based on Replacement) and DLNW-D (Dynamic Locking with No-Waiting based on Delay) protocols deviate from the normal two-phase Dynamic Locking with Waiting (DLW) protocol in that the transacti...

May 1 1991  
  An approximation algorithm for space-optimal encoding of a text
Katajainen J., Raita T. The Computer Journal 32(3): 228-237, 1989.  Type: Article

This paper uses a network formulation for solving the optimal encoding (compression) problem of text. The authors develop an optimal algorithm for the problem of text encoding based on its equivalence to the shortest-path problem in ac...

Apr 1 1990  
  A note on the DMC data compression scheme
Bell T., Moffat A. The Computer Journal 32(1): 16-20, 1989.  Type: Article

This paper presents a theoretical explanation of the observed performance of the dynamic Markov compression (DMC) scheme proposed by Cormack and Horspool [1], which uses a finite state automaton (FSA) to model the text data to be compr...

Oct 1 1989  
  Data compression: methods and theory
Storer J. (ed), Computer Science Press, Inc., New York, NY, 1988.  Type: Book (9789780716781561)

Storer’s book deals with data compression, which has recently received considerable renewed interest. Chapters 1 and 2 provide introductory material on the basic concepts and notations and briefly review some data compression...

May 1 1989  
  Concurrent histories: a basis for observing distributed systems
Degano P. (ed), Montanari U. Journal of Computer and System Sciences 34(2-3): 422-461, 1987.  Type: Article

This paper presents a model of distributed systems called distributed transition systems. The model is intended as a formal tool for the observation of concurrent computations. The paper motivates the need to distinguish between...

Sep 1 1988  
  Disk file allocation based on the buddy system
Koch P. ACM Transactions on Computer Systems 5(4): 352-370, 1987.  Type: Article

This paper describes the results of a study conducted to evaluate the performance of the file allocation used in the Dartmouth time-sharing system (DTSS). DTSS is a general-purpose operating system that utilizes a variant of the binary...

Jun 1 1988  
 
 
 
Display per column
 
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy