Patents Represented by Attorney, Agent or Law Firm Shireen Irani Bacon
-
Patent number: 8117025Abstract: According to one embodiment of the invention, a method classifying a number of noun phrases in a first text passage and a second text passage into a number of classifications. The method also includes determining a similarity between a noun phrase from the first text passage and a noun phase from the second text passage for each of the noun phrases of a same classification. Additionally, a similarity between a sentence from the first text passage and a sentence from the second text passage is determined for each of the sentences in the first and second text passages based on similarities between the noun phrases. The method also includes determining a similarity between the first text passage and the second text passage based on a similarity between sentences.Type: GrantFiled: August 9, 2010Date of Patent: February 14, 2012Assignee: Intel CorporationInventors: Weiquan Liu, Joe F. Zhou
-
Patent number: 8095920Abstract: The latencies associated with cache misses or other long-latency instructions in a main thread are decreased through the use of a simultaneous helper thread. The helper thread is a speculative prefetch thread to perform a memory prefetch for the main thread. The instructions for the helper thread are dynamically incorporated into the main thread binary during post-pass operation of a compiler.Type: GrantFiled: September 17, 2002Date of Patent: January 10, 2012Assignee: Intel CorporationInventors: Steve Shih-wei Liao, Perry H. Wang, Hong Wang, Gerolf F. Hoflehner, Daniel M. Lavery, John P. Shen
-
Patent number: 7941791Abstract: Compiling a source code program for a heterogeneous multi-core processor having a first instruction sequencer, having a first instruction set architecture, an accelerator to the first instruction sequencer, wherein the accelerator comprises a heterogeneous resource with respect to the first instruction sequencer having a second instruction set architecture, the source code program having specified therein a region of source code for the first instruction set architecture of the processor and a region of source code for the second instruction set architecture of the processor.Type: GrantFiled: April 13, 2007Date of Patent: May 10, 2011Inventors: Perry Wang, Jamison Collins, Gautham Chinya, Hong Jiang, Hong Wang, Xinmin Tian, Guei-Yuan Lueh
-
Patent number: 7908456Abstract: Methods and systems are provided for managing memory allocations and deallocations while in transactional code, including nested transactional code. The methods and systems manage transactional memory operations by using identifiers, such as sequence numbers, to handle memory management in transactions. The methods and systems also maintain lists of deferred actions to be performed at transaction abort and commit times. A number of memory management routines associated with one or more transactions examine the transaction sequence number of the current transaction, manipulate commit and/or undo logs, and set/use the transaction sequence number of an associated object, but are not so limited. The methods and systems provide for memory allocation and deallocations within transactional code while preserving transactional semantics. Other embodiments are described and claimed.Type: GrantFiled: November 10, 2009Date of Patent: March 15, 2011Assignee: Intel CorporationInventors: Ben Hertzberg, Bratin Saha, Ali-Reza Adi-Tabatabai
-
Patent number: 7458065Abstract: A method for analyzing a set of spawning pairs, where each spawning pair identifies at least one speculative thread. The analysis may be practiced via software in a compiler, binary optimizer, standalone modeler, or the like. The analysis may include determining a predicted execution time for a sequence of program instructions, given the set of spawning pairs, for a target processor having a known number of thread units, where the target processor supports speculative multithreading. The method is further to select a spawning pair, according to a greedy approach, if the spawning pair provides a performance enhancement, in terms of decreased execution time due to increased parallelism, when the speculative thread is spawned during execution of a code sequence. Other embodiments are also described and claimed.Type: GrantFiled: September 21, 2004Date of Patent: November 25, 2008Assignee: Intel CorporationInventors: Jesus Sanchez, Carlos Garcia, Carlos Madriles, Peter Rundberg, Pedro Marcuello, Antonio Gonzalez
-
Patent number: 7444667Abstract: A method and system are disclosed for performing trusted computing for blade devices, such as blade servers or other blade devices. The computing domain for the blade devices is managed by a chassis management logic module. Methods for performing blade capability authorization and optional blade authentication are provided. A method for performing blade device boot processing is also provided.Type: GrantFiled: July 28, 2003Date of Patent: October 28, 2008Assignee: Intel CorporationInventors: Mallik Bulusu, Vincent J. Zimmer
-
Patent number: 6408383Abstract: The present invention provides a method and apparatus for executing a boundary check instruction that provides accelerated bound checking. The instruction can be used to determine whether an array address represents a null pointer, and whether an array index is less than zero or greater than the size of the array. Three extensions of a boundary check instruction are provided, with each performing a different combination of three boundary check comparisons. One comparison compares a first operand, which may contain the base address of an array, to zero. Another comparison evaluates the value of a second operand, which may contain an index offset, to determine if it is less than zero. The other comparison evaluates whether the value of the second operand is greater than or equal to a third operand. The third operand may indicate the size of an array. A trap is generated if any of the comparisons evaluates to true.Type: GrantFiled: May 4, 2000Date of Patent: June 18, 2002Assignee: Sun Microsystems, Inc.Inventors: Marc Tremblay, James Michael O'Connor
-
Patent number: 6401175Abstract: A shared write back buffer for storing data from a data cache to be written back to memory. The shared write back buffer includes a plurality of ports, each port being associated with one of a plurality of processing units. All processing units in the plurality share the write back buffer. The shared write back buffer further includes a data register for storing data provided through the input ports, an address register for storing addresses associated with the data provided through the input ports, and a single output port for providing the data to the associated addresses in memory.Type: GrantFiled: October 1, 1999Date of Patent: June 4, 2002Assignee: Sun Microsystems, Inc.Inventors: Marc Tremblay, Andre Kowalczyk, Anup S. Tirumala
-
Patent number: 6374351Abstract: The present invention provides software branch prediction filtering for a microprocessor. In one embodiment, a method for a software branch prediction filtering for a microprocessor includes determining whether a branch is “easy” to predict, and predicting the branch using software branch prediction if the branch is easy to predict. Otherwise (i.e., the branch is “hard” to predict), the branch is predicted using hardware branch prediction. Accordingly, more accurate but space-limited hardware branch prediction resources are conserved for hard-to-predict branches.Type: GrantFiled: April 10, 2001Date of Patent: April 16, 2002Assignee: Sun Microsystems, Inc.Inventor: Marc Tremblay
-
Patent number: 6334103Abstract: The present invention provides a voice user interface with personality. In one embodiment, a method includes executing a voice user interface, and controlling the voice user interface to provide the voice user interface with a personality. The method includes selecting a prompt based on various context situations, such as a previously selected prompt and the user's experience with using the voice user interface.Type: GrantFiled: September 1, 2000Date of Patent: December 25, 2001Assignee: General Magic, Inc.Inventors: Kevin J. Surace, George M. White, Byron B. Reeves, Clifford I. Nass, Mark D. Campbell, Roy D. Albert, James P. Giangola
-
Patent number: 6282617Abstract: A method for selecting a candidate to mark as overwritable in the event of a cache miss while attempting to avoid a write back operation. The method includes associating a set of data with the cache access request, each datum of the set is associated with a way, then choosing an invalid way among the set. Where no invalid ways exist among the set, the next step is determining a way that is not most recently used among the set. Next, the method determines whether a shared resource is crowded. When the shared resource is not crowded, the not most recently used way is chosen as the candidate. Where the shared resource is crowded, the next step is to determine whether the not most recently used way differs from an associated source in the memory and where the not most recently used way is the same as an associated source in the memory, the not most recently used way is chosen as the candidate.Type: GrantFiled: October 1, 1999Date of Patent: August 28, 2001Assignee: Sun Microsystems, Inc.Inventors: Anup S. Tirumala, Marc Tremblay