-
公开(公告)号：MX173231B
公开(公告)日：1994-02-09
申请号：MX2636491
申请日：1991-06-25
Applicant: IBM
Inventor： FEIGENBAUM BARRY ALAN , SPRINGHETTI RODNEY PETE
IPC: G06F9/445
Abstract: A data processing system, such as a personal computer, contains bootable disk operating system (DOS) programs that are stored in a read only memory (ROM) as an alternate file system in which the files are stored in packed format. When the system is powered on, the programs are rapidly booted up or loaded from read only memory (ROM) into random access memory (RAM) and executed to "instantly" (as it appears to the user) place the system in operation.
-
公开(公告)号：DE3780807D1
公开(公告)日：1992-09-03
申请号：DE3780807
申请日：1987-12-15
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.
-
13.发明专利
公开(公告)号：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.
-
公开(公告)号：AU4186885A
公开(公告)日：1985-11-07
申请号：AU4186885
申请日：1985-05-01
Applicant: IBM
Inventor： FEIGENBAUM BARRY ALAN , GIBBS DENNIS DARRELL , SACHSENMAIER ROBERT
Abstract: Computer systems linked to nodes in a communication network communicate directly with each other to establish name associations for entities (e.g. programs, storage files, etc.) susceptible of being shared across the network, and thereafter communicate further by names (rather than addresses) to establish sessions (i.e. logical connections over the network) between entities. Each system maintains a table of names assigned to locally accessible entities. The name and session establishment processes are architected to avoid dependence on any "central" or "master" system, and to allow for extension of communications relating to these processes across devices linking portions of the network associated with different communication media or channels.
-
公开(公告)号：PH27427A
公开(公告)日：1993-06-21
申请号：PH36536
申请日：1988-02-19
Applicant: IBM
Inventor： CRISTOPHER KENNETH WALTER JR , FEIGENBAUM BARRY ALAN , KIM JIN NMI , LOVE DOUGLAS CARLETON
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 Ranking
公开(公告)号：HK66492A
公开(公告)日：1992-09-11
申请号：HK66492
申请日：1992-09-03
Applicant: IBM
Inventor： FEIGENBAUM BARRY ALAN , GIBBS DENNIS DARRELL , SACHSENMAIER ROBERT
Abstract: Computer systems linked to nodes in a communication network communicate directly with each other to establish name associations for entities (e.g. programs, storage files, etc.) susceptible of being shared across the network, and thereafter communicate further by names (rather than addresses) to establish sessions (i.e. logical connections over the network) between entities. Each system maintains a table of names assigned to locally accessible entities. The name and session establishment processes are architected to avoid dependence on any "central" or "master" system, and to allow for extension of communications relating to these processes across devices linking portions of the network associated with different communication media or channels.
-
公开(公告)号：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.
-
公开(公告)号：BR8501648A
公开(公告)日：1985-12-10
申请号：BR8501648
申请日：1985-04-09
Applicant: IBM
Inventor： FEIGENBAUM BARRY ALAN , GIBBS DENNIS DARRELL , SACHSENMAIER ROBERT
Abstract: Computer systems linked to nodes in a communication network communicate directly with each other to establish name associations for entities (e.g. programs, storage files, etc.) susceptible of being shared across the network, and thereafter communicate further by names (rather than addresses) to establish sessions (i.e. logical connections over the network) between entities. Each system maintains a table of names assigned to locally accessible entities. The name and session establishment processes are architected to avoid dependence on any "central" or "master" system, and to allow for extension of communications relating to these processes across devices linking portions of the network associated with different communication media or channels.
-
公开(公告)号：GB2204161B
公开(公告)日：1991-09-18
申请号：GB8728924
申请日：1987-12-10
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.
-
公开(公告)号：HK9491A
公开(公告)日：1991-02-08
申请号：HK9491
申请日：1991-01-31
Applicant: IBM
Inventor： FEIGENBAUM BARRY ALAN , SACHSENMAIER ROBERT , SKOWBO JAMES WILLIAM
Abstract: The present disclosure concerns a method for allowing for adoption of names either on a unique basis (association of the name with one and only one entity) or a non-unique basis (association of one name to plural entities), in a data communication system that allows communicating processors to act without reliance on a common directory to adopt logical names for respective locally attached entities (programs, data files, human operators, etc.), and to initiate sessions relative to remote entities by means of communications directed to respective entity names (rather than addresses associated with the physical locations of respective entities). Names adopted on a non-unique basis are flagged as such in the adopting system, and name checking communications directed to such names are ignored by processors serving the respective entity (thereby allowing the checking processors to adopt the respective non-unique name, using the existing procedure for adopting unique names, and thereby enabling processors serving a group of entities to adopt a common name for directing network communications to the entire group concurrently). The disclosure describes specific communication applications made possible by this non-unique naming capability. (Fig. 6)
-
-
-
-
-
-
-
-
-
Search Results
25
records
(took 0.034 seconds)
