Patent application number | Description | Published |
20080201697 | EXTENSIBLE MARKUP LANGUAGE PARSING USING MULTIPLE XML PARSERS - Disclosed are a method, information processing system, and a computer readable medium for parsing a hierarchical markup document. The method includes initializing a first parser for parsing a hierarchical markup document. The first parser parses the hierarchical markup document. A shared parsing state associated with a set of parsers including the first parser is monitored. The parsing control is passed to at least a second parser. The at least second parser parses the hierarchical markup document. The shared parsing state is also monitored during the parsing by the at least second parser. | 08-21-2008 |
20080228810 | Method for Validating Ambiguous W3C Schema Grammars - A method for generating XML (Extensible Markup Language) parsers, including: parsing an input document with a generated parser where the generated parser is generated by a three-stage compilation of an XML Schema, where in a first stage the XML Schema is read and modeled in terms of abstract schema components, where in a second stage the XML Schema is augmented with a set of calculated schema components and properties, and where in a third stage the XML Schema is traversed to generate validation code; the validation code is generated by: calculating prohibited occurrence ranges; generating code to: evaluate each of the plurality of particles in an inner loop conditioned on an effective upper bound; then, once the inner loop terminates, check forbidden occurrence ranges for an inner particle, and calculate a range of possible repetitions of an outer particle; and once an outer loop terminates, check a range of total possible repetitions of the outer particle against its actual occurrence limits. | 09-18-2008 |
20080229188 | Simple One-Pass W3C XML Schema Simple Type Parsing, Validation, and Deserialization System - A method for validating simple type data in XML documents, the method comprising: identifying data via an Extensible Markup Language (XML); developing schema for specifying formal data typing and validation of element content in terms of data types; generating a parser for parsing the collection of elements in a first stage where the schema is read and modeled in terms of abstract schema components, a second stage where the schema is augmented with a set of calculated schema components and properties used to drive code generation, and a third stage where the schema is traversed to generate a validation code for each of the collection of elements, and generate simple type validator modules which perform well-formedness checking the data; validating the simple type data against specific type information; and converting the data to datatype-specific form, all in a single pass. | 09-18-2008 |
20080229292 | Validator-Driven Architecture of an XML Parsing and Validating Solution - A method for parsing a document in an Extensible Markup Language (XML) format includes identifying data via the XML format, defining a tag set including a plurality of tags, defining a tokenizer that produces one token at a time, parsing the XML document via a parser, validating the XML document via a validation engine, the validation engine driving the tokenizer, the validating being an integral part of the parsing, and permitting the validation engine to be written in a recursive-descent code-driven manner. | 09-18-2008 |
20080229293 | Data Reporting Application Programming Interfaces in an XML Parser Generator for XML Validation and Deserialization - A method for interfacing with an XML (Extensible Markup Language) parser generator to generate deserialization information interleaved with XML parsing and validation, including: providing an XML parser generator with information about the schema which the instance data conforms to; providing a data reporting application programming interface (API) and a generator module; providing one or more implementations of the data reporting API; providing the XML parser generator with a selected data reporting API implementation module; generating an XML parser to parse and validate instance documents conforming to the specified input schema and deserializing the instance documents into the desired deserialization format during the parse. | 09-18-2008 |
20120159502 | VARIABLE INCREMENT REAL-TIME STATUS COUNTERS - Processes, devices, and articles of manufacture having provisions to monitor and track multi-core Central Processor Unit resource allocation and deallocation in real-time are provided. The allocation and deallocation may be tracked by two counters with the first counter incrementing up or down depending upon the allocation or deallocation at hand, and with the second counter being updated when the first counter value meets or exceeds a threshold value. | 06-21-2012 |
20120167113 | VARIABLE INCREMENT REAL-TIME STATUS COUNTERS - Processes, devices, and articles of manufacture having provisions to monitor and track multi-core Central Processor Unit resource allocation and deallocation in real-time are provided. The allocation and deallocation may be tracked by two counters with the first counter incrementing up or down depending upon the allocation or deallocation at hand, and with the second counter being updated when the first counter value meets or exceeds a threshold value. | 06-28-2012 |
Patent application number | Description | Published |
20080281937 | ROUTING INSTANT MESSAGES USING CONFIGURABLE, PLUGGABLE DELIVERY MANAGERS - Configurable, pluggable delivery managers are responsible for routing instant messages to intended recipients. A delivery manager is selected for a particular message, and that delivery manager defines, at runtime, a delivery policy to be used to route the instant message to an intended recipient of the message. The delivery policy is based upon a configuration of the delivery manager, a user configuration of the intended recipient, and one or more available delivery mechanisms. The delivery manager routes the instant message using the delivery policy. | 11-13-2008 |
20110153690 | HARDWARE OFF-LOAD MEMORY GARBAGE COLLECTION ACCELERATION - A memory allocation message for each primary memory allocation in a primary memory made by a primary processor is received at a hardware memory management module. A representation of each primary memory allocation is allocated within a second memory in response to each memory allocation message. A determination is made, based upon the allocated representations of each primary memory allocation within the second memory, to free a primary memory allocation in the primary memory. A memory free message is sent to the primary processor instructing the primary processor to free the primary memory allocation in the primary memory. | 06-23-2011 |
20110153691 | HARDWARE OFF-LOAD GARBAGE COLLECTION ACCELERATION FOR LANGUAGES WITH FINALIZERS - A memory allocation message for each primary memory allocation in a primary memory made by a primary processor is received at a hardware memory management module, including an indication of whether a finalizer routine is associated with each primary memory allocation. A representation of each primary memory allocation is allocated within a second memory in response to each memory allocation message, including the indication of whether there is the associated finalizer routine. A determination is made, based upon the allocated representations of each primary memory allocation within the second memory, to free a primary memory allocation in the primary memory. A call object finalizer message is sent to the primary processor instructing the primary processor to call the finalizer routine associated with the primary memory allocation in the primary memory in response to determining that the primary memory allocation has the associated finalizer routine. | 06-23-2011 |
20120124106 | GARBAGE COLLECTION OF INTERNED STRINGS - Provided are techniques for a garbage-collected interned string table. Reference objects that each reference strings in the interned string table are created. The reference objects and the strings referenced by the reference objects in the interned string table are marked with a current generation. Garbage collection is performed by: advancing the current generation to a next generation; in response to the reference objects in a previous generation from the current generation advancing to an acquired references state, promoting the reference objects and the strings referenced by the reference objects in the previous generation to the current generation; and deleting the strings that are marked with the previous generation in the interned string table. | 05-17-2012 |