Skip Navigation

The Computer Journal 1988 31(6):490-495; doi:10.1093/comjnl/31.6.490
© 1988 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (3)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Goyal, P.
Right arrow Articles by Narayanan, T. S.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Dictionary Machine with Improved Performance

P. Goyal * and T. S. Narayanan *

Department of Computer Science, Concordia University, Montreal H3G 1M8, Canada

This paper proposes a dictionary machine which can handle redundant instructions on a modified semi X-tree structure in one pass. The proposed machine which is based on Leiseron's3 design operates with a pipeline interval of two steps. The cell complexity of the design is comparable to that of Leiserson's. Unlike other designs4,5,6 where cell complexity, pipeline interval and structure are compromised to get optimal response time, in this design, response time is compromised to get better pipeline interval, cell complexity and structure. The reason for taking this approach is presented in the paper.

Received February 1987.

* Department of Computer Science, Concordia University, Montreal H3G 1M8, Canada


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.