Abstract: A system and method for generating design constraints for a logic synthesized block from timing analysis of the block. A timing analysis of logic described in software is performed for each of various operating modes of a circuit in which the logic is used. Timing data is extracted from the timing analysis and used as design constraints in the synthesis of the logic for the block.

Abstract: Improved logging techniques that produce transaction logs are disclosed. The logging techniques are able to consolidate multiple related partial operations performed on a server device into a single log entry in a transaction log. Accordingly, the logging techniques are well suited for logging operations of protocols in which transactions are often completed over multiple operations. The logging techniques are particularly well suited for logging access to NFS file and/or directory resources with respect to a NFS server, even when the NFS operations are performed via Remote Procedure Calls (RPCs) to the NFS server.

Abstract: A scheme is provided that permits the use of a selectable depacketization module to depacketize data streams. An RTP session manager is responsible for receiving RTP packets from a network and parsing/processing them. A depacketizer module is located using the type of data received on the stream. Thus a specific depacketizer is located at runtime depending on the coding decoding scheme (“codec”) used to compress the incoming data stream. A naming convention is followed in order for a specific depacketizer to be located. The depacketizer receives data that has already been parsed and is in a readable form. The depacketizer outputs this data using a well defined interface. This interface has been designed such that it is generic across a number of codecs. The interface passes all relevant information to the decoder where the actual depacketized data stream will be decompressed. The session manager need not know of any codec details since the depacketizer handles all codec specific issues.

Abstract: A tool is provided for cross-sectioning an integrated circuit in a hands-free mode of operation. The tool comprises an enclosure or cage having a passageway through which a sample—such as an integrated circuit, which may be encased in epoxy or some other substance—is brought into contact with an abrasive surface such as a milling disk. A wall or plate of the enclosure is adjustable in order to accommodate a variety of sample sizes, including both dies and packages. During the grinding or polishing of the sample the rotation of the milling disk helps stabilize the sample against the adjustable wall and one or more other walls of the enclosure. The enclosure is situated at a selectable position along a frame or guide that is mounted above the milling disk. Releasable connectors are used to secure the enclosure in a selected position yet allow it to be relocated as the milling disk becomes worn.

Abstract: An embodiment of the present invention provides an efficient and robust way to facilitate interoperability between two or more processes which were initially written to execute on top of two different operating systems but instead execute on top of a third operating system. Typically, the preferred embodiment begins by launching a parent process which was initially written to execute on top of a first operating system. The preferred embodiment then obtains a context object that implements a naming graph for the parent process. The context object includes bindings between a given set of names and an associated set of objects that are specific to the first operating system. At some point during execution of the parent process, the parent process spawns a child process which was initially written to execute on top of a second operating system. Next, the parent process instantiates a copy of its context object.

Abstract: A remote terminal emulator (RTE) is provided in which substantially all of the time elapsing during an emulated use of a computer system under test is categorized and reported. The time required by the computer system under test to respond to command signals transmitted by the RTE is recorded as a receive time and is measured from completion of the transmission of the command signals to recognition of a pattern specified by the RTE as signifying completion of the response by the computer system under test. As a result the receive time recorded reflects the time required by the computer system under test to (a) process and carry out the command transmitted by the RTE and (b) transmit response data back to the RTE.

Abstract: A user operating a client system may access a plurality of remote servers requiring passwords for access by employing a master password. The master password is used to decrypt a stored password for a particular remote server to which the client desires access. The client system maintains a database of encrypted passwords and user IDs for remote servers to which the user is registered. Although each remote server is accessed using a different password, the user need only remember one master password. Since only the master password need be remembered, the passwords particular to specific remote sites may be made more random and thus more secure. Implementation of the password management system need not require modification of any remote servers.

Abstract: A monitoring system generates alerts indicating predefined conditions exist in a computer system. Alerts are generated by comparing alert definitions to a host state representing the state of the hardware and software components of a computer system. to determine if conditions defined in the alert definitions exist in the host state; and generating alerts accordingly. The host state is a static tree structure including elements in a fixed hierarchical relationship, the elements being given value by associated tokens, the elements and associated tokens representing the hardware and software components of the computer system. The alert definitions generate alerts according to the values of at least one token, at least one alert or a combination of various tokens and/or alerts. The host state is created by providing a static tree structure representing a general computer system.

Abstract: Systems and methods consistent with the present invention respond to queries of stored information by receiving a query identifying desired information; providing the query as a search request to a search engine; receiving a search result from the search engine, including identifiers for stored documents; and constructing an index from the documents using the identifiers in the search result.

Abstract: Method and apparatus for locking by sharing lock states. Each resource or object has an associated lock state (that may be cached) comprised of transactions that own a lock in a specific mode for the resource. Several resources may share the same lock state. In one embodiment of the invention, a table of immutable lock states (TILS) is utilized to maintain the correct association of locked resources and immutable lock states. To acquire a lock, a new lock state is computed by adding the current transaction to the old lock state. If the new lock state is already in the TILS, the association between the resource and the lock state is updated to reflect the new lock state. If the new lock state is not in the TILS, the new lock state is added to the TILS. To release a lock, the transaction determines the new lock state that will result after removal from the lock state for that resource. The association between the resource and the lock state is then updated to reflect the change.

Abstract: A database system wherein one or more entry databases store a plurality of entries. Each entry is of a given type that defines the fields of the entry. Each field contains or identifies an object with associated attributes or data. The type of each entry may further define behavior in the form of methods the entry can implement. An entry type which is a subtype of another inherits all fields and behavior of its super-type, and contains additional fields and/or defines new/modified behavior. Entries may be expressed in a Java™ programming language. The database system may further employ a search engine which allows queries to be made upon entries in the database. In one implementation, the queries include a read operation, a take operation, and a notify operation. Each query request includes a command indicating the type of operation, and a template which is an entry object having some or all of its fields set to specific values that must be matched exactly.

Abstract: Method and apparatus for efficiently scheduling tasks on a network. A user may schedule node-specific tasks across the network without specifying particular times for each node. One application of the present invention is scheduling of survey tasks across the network. A user may select times at which a task is to be performed or exclusion times when a task is not to be performed at the node level, subnet level, or level of the whole network.

Abstract: The present invention pertains to a dynamic process for generating biased pseudo-random test patterns for the functional verification of a microprocessor having a bus interface unit that is capable of direct memory access (DMA) operations between I/O devices attached to an external bus and the microprocessor's memory. The test patterns verify memory operations performed by the microprocessor and DMA operations received by the microprocessor's bus interface unit. These test patterns can then be used by a simulation mechanism to simulate the expected results of the target microprocessor running the generated sequence of transactions. The test verification system categorizes the verifiable operations into transactions. Each transaction is assigned a user-defined weight that is used to bias the frequency that a transaction is tested.

Abstract: An object-relational mapping tool that can process views is provided. In processing views, the object-relational mapping tool identifies the dependency relationship between the various views and tables and allows the programmer to customize the mapping that will occur by selectively determining which tables and views get mapped. This customization allows the mapping tool to map an individual table or view or to map (1) all tables and views, (2) all tables only, and (3) tables and views for which there are no dependencies. Also, the mapping tool allows the programmer to view and set the updatability of a particular view or table.

Abstract: An apparatus, system, and method for arbitrating for a serial bus in an efficient manner. An arbitration phase includes master devices asserting respective arbitration addresses on the serial bus after initiating communications sequences with a START condition. After the arbitration phase, the controlling master device conveys a data transfer upon the serial bus. The serial bus and the devices connected thereto may operate according to an I2C-compatable protocol. The arbitration address may correspond to a slave address associated with a slave device. Each arbitration address is preferably associated with only one master device. The arbitration address preferably initiates a READ cycle, and the slave device responds with a data byte. The data byte may be stored, discarded, or ignored by the master device, as desired. The arbitration address may not be associated with any slave device coupled to the serial bus.

Abstract: A memory cache method and apparatus with two memory execution pipelines, each having a translation lookaside buffer (TLB). Memory instructions are executed in the first pipeline (324) by searching a data cache (310) and a prefetch cache (320). A large data TLB (330) provides memory for storing address translations for the first pipeline (324) A second pipeline (328) executes memory instructions by accessing the prefetch cache (320). A second micro-TLB (340) is associated with the second pipeline (328). It is loaded in anticipation of data that will be referenced by the second pipeline (328). A history file (360) is also provided to retain information on previous instructions to aid in deciding when to prefetch data. Prefetch logic (370) determines when to prefetch data, and steering logic (380) routes certain instructions to the second pipeline (328) to increase system performance.

Abstract: Methods, software and data structures for installing a component in a container suitable for display on a display screen as part of a graphical user interface are disclosed. In one embodiment, a name and desired location for a component are provided. Both the desired component and a component object table that is to be associated with the component are then created. The component object table is arranged to identify both the location and identity of the component. The component object table is then referenced in a container lookup table arranged to associate the component object table with a container at the desired location. In a preferred embodiment, the container is a sliding panel associated with a window suitable for display on the monitor. The sliding panel is capable of supporting a plurality of handles that act as independent sub-containers.

Abstract: The present invention is directed to a sorber which is suitable for use in an electromagnetic wave activated sorption system and which is easily adaptable to packaging constraints. One embodiment of the sorber comprises a flexible enclosure having an outer conductor, and inner conductor, a port through which a sorbate can be communicated into and out of said enclosure, and a sorbent in the enclosure which can adsorb the sorbate to form a sorbate/sorbent compound. The enclosure is configured to be coupled to an electromagnetic wave generator so that waves generated by the electromagnetic wave generator propagate through the sorbate/sorbent compound within the enclosure. Another embodiment of the sorber comprises an enclosure which is configured to serve as a structural component.

Abstract: An object structure's header (40) allocates a two-bit synchronization-state field (42) solely to monitor data for implementing synchronization on that object. When the object is locked by a particular execution thread, or when one or more execution threads are waiting for a lock or notification on that object, its header contains a pointer to monitor resources in the form of a linked list of lock records (50, 52, 54) associated with the threads involved. The synchronization-state field (42) ordinarily contains an indication of whether such a linked list exists and, if so, whether its first member is associated with a thread that has a lock on the object. When a thread attempts to gain access to that linked list, it employs an atomic swap operation to place a special busy value in that lock-state field (42) and write its execution-environment pointer into the object's header (40).

Abstract: A method for isolating a pin of a ball grid array (BGA) device mounted on a printed circuit board, and routing the signal carried by the isolated pin to an alternate location. The BGA device pin is isolated by removing the solder ball to expose the device pad. A rework or engineering wire is then soldered to the BGA device pad using a high temperature solder. The rework wire is then routed between the other solder pads to the edge of the BGA device package. The BGA device is then reflowed at a temperature lower than the reflow temperature of the high temperature solder. The rework wire is used to route the signal carried by the isolated BGA pin to an alternate location. The present invention provides for higher process yields than conventional rework processes.