-
公开(公告)号：JP2002108671A
公开(公告)日：2002-04-12
申请号：JP2001198477
申请日：2001-06-29
Applicant: IBM
Inventor： CHALLENGER JAMES R H , DANTZIG PAUL M , DIAS DANIEL M , IYENGAR ARUN K , SONG JUNEHWA
Abstract: PROBLEM TO BE SOLVED: To provide a method and system for caching customized information in a network server system. SOLUTION: A rule for deciding whether at least one customized block of data should be generated or fetched is defined. Then, a customizable template is generated. This customizable template includes the rule reference and offset specifying a place where the customized block is inserted into the customizable template. Then, the customized block is inserted into the place specified by the offset of the customizable template. The customized block, the customizable template, and/or the rule can be preliminarily stored in a cache 106 of this computer processing system. Also, the customized block can be dynamically generated.
-
公开(公告)号：JP2000306011A
公开(公告)日：2000-11-02
申请号：JP2000096101
申请日：2000-03-31
Applicant: IBM
Inventor： CHALLENGER JAMES R H , FERSTAT CAMERON , IYENGAR ARUN K , REED PAUL , SPIVAK GERALD A , WITTING KAREN A
Abstract: PROBLEM TO BE SOLVED: To provide a system and a method for generating a complicated web page for improving the flexibility and performance of web page design in comparison with a conventional method for processing the entire web page as a single logic entity. SOLUTION: This method for constructing and disclosing plural objects is provided with a step for providing plural fractions, a step for constructing an object from the plural fractions, a step for delaying the disclosure of at least one object containing at least one fraction belonging to a first class to examine contents and a step for disclosing at least one object containing at least one fraction belonging to a second class without examining contents.
-
公开(公告)号：JP2004206733A
公开(公告)日：2004-07-22
申请号：JP2004061168
申请日：2004-03-04
Applicant: Internatl Business Mach Corp
, インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation Inventor： CHALLENGER JAMES R H , IYENGAR ARUN K
CPC classification number: G06F12/023 , G06F3/0611 , G06F3/064 , G06F3/0644 , G06F3/0676 , Y10S707/99953 , Y10S707/99956
Abstract: PROBLEM TO BE SOLVED: To provide a dynamic storage method reducing the number of access times and the number of writing times to a memory as compared to before, and to provide a more efficient memory allocation and an allocation release method allowing higher-speed access.
SOLUTION: This method for managing a computer memory is a method for managing blocks of a consecutive permanent memory. The method includes: a step for holding, in a main memory, a first pointer deciding the first free byte inside a first block of the memory; a step for holding a header including at least one code byte in a permanent storage area; and a step for allocating a second block from the first block by setting at least one code byte showing that the second block is already not a part of the first block, to the second block, and updating the first pointer in the main memory.
COPYRIGHT: (C)2004,JPO&NCIPI-
公开(公告)号：JP2001249844A
公开(公告)日：2001-09-14
申请号：JP2001032286
申请日：2001-02-08
Applicant: IBM
Inventor： CHALLENGER JAMES R H , IYENGAR ARUN K
Abstract: PROBLEM TO BE SOLVED: To provide a dynamic storage method and its system for a disk memory to reduce access frequency and writing frequency to a disk. SOLUTION: Plural sets of free blocks of a memory are held by a method to manage a computer memory and the free blocks are added to the sets based on their size. Sets of blocks are searched by calculating free blocks at least with the same size as requested size, however, less than the size obtained by adding a threshold to the requested size according to a request for blocks with the requested size. When such blocks are found, the entire blocks are allocated.
-
公开(公告)号：JP2001249835A
公开(公告)日：2001-09-14
申请号：JP2001032350
申请日：2001-02-08
Applicant: IBM
Inventor： CHALLENGER JAMES R H , IYENGAR ARUN K
Abstract: PROBLEM TO BE SOLVED: To provide a dynamic storage method and its system for disk memory to reduce access frequency and writing frequency to a disk. SOLUTION: In this memory storage system including a main memory and at least one memory device, a method to manage a permanent storage area includes a step to hold a header including the size of each block and allocation states in the permanent storage area for a plurality of blocks and a step to hold at least one data structure in the main memory to allocate the permanent storage area and to release the allocation. Storage blocks are allocated by discriminating storage blocks by using at least a piece of the data structure in the main memory, changing at least a piece of the data structure in the main memory and allocating allocation states to the blocks on the disk. On the other hand, the release of the allocation of the storage blocks is performed by allocating the allocation states on the disk to the block and changing at least a piece of data structure in the main memory.
-
Patent Agency Ranking
公开(公告)号：JPH11120066A
公开(公告)日：1999-04-30
申请号：JP21284698
申请日：1998-07-28
Applicant: IBM
Abstract: PROBLEM TO BE SOLVED: To obtain consistency on another system including a transaction manager by deciding how alterations of basic data affect the values of one or more hybrid objects. SOLUTION: A client 90 communicates a request to a server 100 through a network 95. The server 100 maintains and uses a cache 2 to improve performance and decreases the CPU time complying with the request of the client 90. At least part of the basic data which can or can not be cached is discriminated. At least part of the basic data is mapped to one or more hybrid objects having single or multiple data dependency on at least part of the basic data. Thus, it can be decided how modifications of the basic data affect the values of one or more hybrid objects.
-
公开(公告)号：CA2206685A1
公开(公告)日：1997-12-07
申请号：CA2206685
申请日：1997-06-02
Applicant: IBM
Inventor： IYENGAR ARUN K
Abstract: A method and system for preserving state in computers communicating over net works, such as the World Wide Web (WWW) using stateless protocols, e.g., HTTP. State is preserved in a conversation between a client requesting services from a served by performin g the service and identifying all continuations (hyperlinks) in an output from the service; re cursively embedding the state information in all identified continuations in the output sent to the client. The state information may be embedded and communicated by the server to the client. Alternatively, dynamically downloadable program code may be used to embed the the state information at the client. Additional features enable the filtering and/or addition of hyperlinks and data output from the services according to predetermined criteria. State information may be embedded by modifying an identified continuation which is a request for an HTML file, to invoke a CGI converter program with the identified continuation and the state information passed as arguments. State informatio n may also be embedded by modifying an identified continuation which is an invocation to a CGI prog ram with the identified continuation and the state information passed as arguments, and the embeddin g step is performed by the CGI program. Alternatively, an identified continuation which is an invoc ation of a CGI program may be modified to invoke a CGI converter program with the identified contin uation, an argument counter which indicates a number of arguments associated with the CGI progra m, and the state information passed as arguments. Here, the embedding is performed by the con verter program.
-
公开(公告)号：CA2351151A1
公开(公告)日：2002-01-26
申请号：CA2351151
申请日：2001-06-21
Applicant: IBM
Inventor： IYENGAR ARUN K , SONG JUNEHWA , DANTZIG PAUL M , CHALLENGER JAMES R H , DIAS DANIEL M
Abstract: A method for providing customized information in a computer processing syste m includes the step of defining at least one rule for one of creating and retrieving at least one customized block of data. At least one customizable template is created which includes at lea st one reference to the at least one rule and at least one offset that specifies at least one positi on at which the at least one customized block is inserted into the at least one customizable template. Th e at least one customized block is inserted into the at least one customizable template at the at leas t one position specified by the at least one offset. The customized block, the customizable template, and/or the rule may be pre-stored in a cache of the computer processing system. The customized bloc k may also be dynamically created.
-
公开(公告)号：CA2332097A1
公开(公告)日：2001-08-15
申请号：CA2332097
申请日：2001-01-23
Applicant: IBM
Inventor： IYENGAR ARUN K , CHALLENGER JAMES R H
Abstract: A method for managing computer memory, in accordance with the present invention, includes maintaining multiple sets of free blocks of memory wherein a free block is added to a set based on its size. In response to a request for a block of a request size, a set of blocks is searched for a free block which is at least as large as the request size but smaller than the request size plus a threshold. If such a block is found, the block is allocated in its entirety.
-
公开(公告)号：CA2338915C
公开(公告)日：2009-01-06
申请号：CA2338915
申请日：2001-02-28
Applicant: IBM
Inventor： ROUVELLOU ISABELLE M , DEGENARO LOUIS R , EHNEBUSKE DAVID L , IYENGAR ARUN K , MCKEE BARBARA JANE ALSPACH
Abstract: A system and method for managing cacheable sets of objects having explicit lifetime specifications, wherein a time-based cache manager maintains and updates one or more sets of objects stored in the cache. A cached set of objects comprises objects havin g start times and/or end times representing, respectively, times at which such objects become val id and expire. An update time is determined for a given cached set of objects based, in part, on the start times and end times of objects comprising the cached set of objects. When a request fo r the retrieval of an object from the given cached set of objects (or the entire cached set) is received, a determination is made if the cached set of objects is valid at the time of the request bas ed on the update time. If the cached set of objects is not valid because, e.g., the update time has elapsed, the cached set of objects is updated (and any other cached sets, if necessary) by deleting and/or adding objects to the cached set of objects having start times and end times that meet predefined time criteria for inclusion in the cached set of objects.
-
-
-
-
-
-
-
-
-
Search Results
14
records
(took 0.052 seconds)
