Browse Prior Art Database

'Best Fit' Selection Algorithm with Performance

IP.com Disclosure Number: IPCOM000123436D
Original Publication Date: 1998-Nov-01
Included in the Prior Art Database: 2005-Apr-04
Document File: 5 page(s) / 179K

Publishing Venue

IBM

Related People

Blea, DR: AUTHOR

Abstract

ABSTRACT There are many best fit solutions when selecting the best item for a given request. However, sometimes if many items are to be searched, and if searching and verifying these items entails several steps which can be time consuming, another solution other than the obvious is required. The particular problem addressed by this paper was to select an entry from a potential list of 9999 entries. This selected entry is termed the 'Best Fit' entry. Selection of the 'Best Fit' entry must be done in a timely manner, and the selected entry must meet certain specific selection criteria.

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 23% of the total text.

'Best Fit' Selection Algorithm with Performance

ABSTRACT

   There are many best fit solutions when selecting the best
item for a given request.  However, sometimes if many items are to be
searched, and if searching and verifying these items entails several
steps which can be time consuming, another solution other than the
obvious is required.  The particular problem addressed by this paper
was to select an entry from a potential list of 9999 entries.  This
selected entry is termed the 'Best Fit' entry.  Selection of the
'Best Fit' entry must be done in a timely manner, and the selected
entry must meet certain specific selection criteria.

   Initially, a table containing the list of potential entries
is built containing the specific selection criteria information (the
solution described in this document uses a table with 9999 entries).
As time progresses, the information in this table may become out of
date.  Therefore, before selecting the 'Best Fit' entry, the
selection criteria information for each entry must be verified to
ensure that the information still meets the selection criteria.  The
problem addressed by the solution described in this document is if
much time is consumed verifying the selection criteria information
for each entry, selection of the 'Best Fit' entry may not occur in a
timely manner (entry may not be found quickly).

   A solution to the above problem is to reduce the number of
entries in the list which are verified.  This solution creates a
table of 10 (and this number could be any number deemed workable)
entries which best meet the selection criteria by searching all the
entries in a 9999 entry table, and selecting the best 10 using the
selection criteria information in the 9999 entry table.

   Each entry in the 10 entry table is built as follows.  Each
entry of the 9999 entry table is searched to determine the best 10
entries found in this 9999 entry table, and these best 10 entries
are placed in the 10 entry table as follows.  If an entry in the 10
entry table is empty, the entry being searched in the 9999 entry
table (that meets the selection criteria) is placed in the empty
entry of the 10 entry table.  When all 10 entries are filled in the
10 entry table, if the entry in the 9999 entry table (that meets the
selection criteria) is better than the worst entry in the 10 entry
table, the worst entry in the 10 entry table is replaced with this
entry from the 9999 entry table.

   The 10 entry table is then sorted so that the best of the
10 is first in the table, followed by the second best, etc.  Then,
the selection criteria information is verified for the best entry in
the 10 entry table.  If the new selection criteria information still
meets the selection criteria (whether it is still the best entry or
not), this entry is chosen as the 'Best Fit' entry.  Otherwise, the
selection criteria information is verified for the next entry in the
10 entry table, and its new selection criteria checked aga...