Browse Prior Art Database

Concurrent Windowed Data Structure Management

IP.com Disclosure Number: IPCOM000036899D
Original Publication Date: 1989-Nov-01
Included in the Prior Art Database: 2005-Jan-29
Document File: 1 page(s) / 12K

Publishing Venue

IBM

Related People

Franklin, SM: AUTHOR [+2]

Abstract

This article describes an efficient method for effectively eliminating the data structures and searching techniques which are required to support objects being displayed and manipulated within a windowing environment. Concurrent Windowed Data Structure Management is achieved by allocating and managing memory associated with object-related windows necessary for storing and retrieving information normally kept in classical data structures such as linked lists, queues, etc., and using system-supplied windowing system calls to replace specialized application-developed search and sorting algorithms.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 63% of the total text.

Page 1 of 1

Concurrent Windowed Data Structure Management

This article describes an efficient method for effectively eliminating the data structures and searching techniques which are required to support objects being displayed and manipulated within a windowing environment. Concurrent Windowed Data Structure Management is achieved by allocating and managing memory associated with object-related windows necessary for storing and retrieving information normally kept in classical data structures such as linked lists, queues, etc., and using system-supplied windowing system calls to replace specialized application-developed search and sorting algorithms.

In order to maintain sets of multiple objects within windows and hierarchies of windows, it has previously been necessary to develop and maintain both the data structures and searching and sorting algorithms necessary to maintain and manipulate object sets within and across windows. This effort required the design and implementation of additional application-specific programming code as well as the additional system overhead associated with executing these algorithms to maintain objects.

Concurrent Windowed Data Structure Management provides a solution to this problem by allocating a storage set with each window or collection of windows that are associated with the object set that is being displayed in the window(s). By imposing the memory allocation as part of the system supplied windowing data structure, the requirement for c...