-
公开(公告)号：HK33892A
公开(公告)日：1992-05-15
申请号：HK33892
申请日：1992-05-07
Applicant: IBM
Abstract: A data processing system has files stored on disks in a tree structure of directories and files. The system is operated to rapidly open files which have been recently opened or for which partial path information is available, by accessing a drive cache (30) in main memory (16). The cache has entries chained in a tree structure which is then searched to provide the same information during the opening process as that information which would otherwise have to be obtained from a disk (22). When the cache is full, a new entry replaces the least recently used entry.
-
Patent Agency Ranking2.发明专利
公开(公告)号：BE1001068A4
公开(公告)日：1989-06-27
申请号：BE8701441
申请日：1987-12-16
Applicant: IBM
Abstract: Un système de traitement de données conprend des fichiers emmagasinés sur des disques dans une structure en arbre de répertoires et de fichiers. Le système est utilisé pour ouvrir rapidement des fichiers qui ont été récemment ouverts ou pour lesquels des informations de chemins partielles sont disponibles, par accès à une antémémoire d'unité d'entrainement en mémoire principale. L'antémémoire a des entrées enchainées dans une structure en arbre qui est alors vérifiée pour founir les memes informations pendant le déroulement du procédé d'ouverture que les informations qui devraient autrement etre obtenues depuis un disque. Lorsque l'antémémoire est pleine, une nouvelle entrée remplace l'entrée la moins récemment utilisée.
-
公开(公告)号：FR2613505A1
公开(公告)日：1988-10-07
申请号：FR8717530
申请日：1987-12-09
Applicant: IBM
Abstract: A data processing system has files stored on disks in a tree structure of directories and files. The system is operated to rapidly open files which have been recently opened or for which partial path information is available, by accessing a drive cache (30) in main memory (16). The cache has entries chained in a tree structure which is then searched to provide the same information during the opening process as that information which would otherwise have to be obtained from a disk (22). When the cache is full, a new entry replaces the least recently used entry.
-
公开(公告)号：BR8801438A
公开(公告)日：1988-11-01
申请号：BR8801438
申请日：1988-03-29
Applicant: IBM
Abstract: A data processing system has files stored on disks in a tree structure of directories and files. The system is operated to rapidly open files which have been recently opened or for which partial path information is available, by accessing a drive cache (30) in main memory (16). The cache has entries chained in a tree structure which is then searched to provide the same information during the opening process as that information which would otherwise have to be obtained from a disk (22). When the cache is full, a new entry replaces the least recently used entry.
-
公开(公告)号：DE3743890A1
公开(公告)日：1988-10-27
申请号：DE3743890
申请日：1987-12-23
Applicant: IBM
Abstract: A data processing system has files stored on disks in a tree structure of directories and files. The system is operated to rapidly open files which have been recently opened or for which partial path information is available, by accessing a drive cache (30) in main memory (16). The cache has entries chained in a tree structure which is then searched to provide the same information during the opening process as that information which would otherwise have to be obtained from a disk (22). When the cache is full, a new entry replaces the least recently used entry.
-
公开(公告)号：IT8819948D0
公开(公告)日：1988-03-25
申请号：IT1994888
申请日：1988-03-25
Applicant: IBM
Abstract: A data processing system has files stored on disks in a tree structure of directories and files. The system is operated to rapidly open files which have been recently opened or for which partial path information is available, by accessing a drive cache (30) in main memory (16). The cache has entries chained in a tree structure which is then searched to provide the same information during the opening process as that information which would otherwise have to be obtained from a disk (22). When the cache is full, a new entry replaces the least recently used entry.
-
-
-
-
-
Search Results
6
records
(took 0.017 seconds)
