Premium
A simple row‐replacement method
Author(s) -
Miller Webb,
Myers Eugene W.
Publication year - 1988
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380180703
Subject(s) - computer science , simple (philosophy) , task (project management) , set (abstract data type) , process (computing) , character (mathematics) , algorithm , transmission (telecommunications) , terminal (telecommunication) , computer hardware , parallel computing , programming language , mathematics , computer network , engineering , telecommunications , philosophy , geometry , systems engineering , epistemology
Updating a video screen involves row replacement, i.e, the task of updating an existing screen row to produce the desired row. In many environments, screen operations require transmitting characters to the terminal by a process that is painfully slow compared to computing speeds. Thus, it is worth while to compute a minimal set of row updating commands, as long as the time to do so does not outweigh the savings in character transmission time. This paper presents a simple and practical algorithm for optimal row replacement and describes experience with its use in a screen editor.