Inventors list |
Assignees list |
Classification tree browser |
Top 100 Inventors |
Top 100 Assignees |
Emad A.
Emad A. Omara, Bellevue, WA US
| Patent application number | Description | Published |
|---|---|---|
| 20110126204 | SCALABLE THREAD LOCKING WITH CUSTOMIZABLE SPINNING - Embodiments described herein are directed to dynamically controlling the number of spins for a selected processing thread among a plurality of processing threads. A computer system tracks both the number of waiting processing threads and each thread's turn, wherein a selected thread's turn comprises the total number of waiting processing threads after the selected thread's arrival at the processor. Next, the computer system determines, based the selected thread's turn, the number of spins that are to occur before the selected thread checks for an available thread lock. The computer system also, based on the selected thread's turn, changes the number of spins, such that the number of spins for the selected thread is a function of the number of waiting processing threads and processors in the computer system. | 05-26-2011 |
| 20110191775 | ARRAY-BASED THREAD COUNTDOWN - The forking of thread operations. At runtime, a task is identified as being divided into multiple subtasks to be accomplished by multiple threads (i.e., forked threads). In order to be able to verify when the forked threads have completed their task, multiple counter memory locations are set up and updated as forked threads complete. The multiple counter memory locations are evaluated in the aggregate to determine whether all of the forked threads are completed. Once the forked threads are determined to be completed, a join operation may be performed. Rather than a single memory location, multiple memory locations are used to account for thread completion. This reduces risk of thread contention. | 08-04-2011 |
Emad A. Omara, Redmond, WA US
| Patent application number | Description | Published |
|---|---|---|
| 20120066667 | SIMULATION ENVIRONMENT FOR DISTRIBUTED PROGRAMS - A scheduler receives a job graph which includes a graph of computational vertices that are designed to be executed on multiple distributed computer systems. The scheduler queries a graph manager to determine which computational vertices of the job graph are ready for execution in a local execution environment. The scheduler queries a cluster manager to determine the organizational topology of the distributed computer systems to simulate the determined topology in the local execution environment. The scheduler queries a data manager to determine data storage locations for each of the computational vertices indicated as being ready for execution in the local execution environment. The scheduler also indicates to a vertex spawner that an instance of each computational vertex is to be spawned in the local execution environment based on the organizational topology and indicated data storage locations, and indicates to the local execution environment that the spawned vertices are to be executed. | 03-15-2012 |
Emad A. Qaddoura, Plano, TX US
| Patent application number | Description | Published |
|---|---|---|
| 20090313692 | KEY EXCHANGE FOR A NETWORK ARCHITECTURE - Provided is a method of providing secure communication between an initiator and a responder in a communication network. The method includes presenting a registration request with one or more proposals for dynamically establishing a security association between the initiator and the responder, and receiving a registration response indicating whether any of the one or more proposals have been accepted for the security association. | 12-17-2009 |
Emad A. Shqair, Sterling, VA US
| Patent application number | Description | Published |
|---|---|---|
| 20090074412 | METHOD, SYSTEM, AND COMPUTER PROGRAM PRODUCT FOR SIMULATING AN UPLINK THROUGH A NETWORK ELEMENT - A method, system and computer program for simulating a communication link, such as an uplink, to one or more external networks in a communication network is provided. A test optical network terminal is connected to the network, and an uplink is simulated through the test optical network terminal, providing access to one or more external networks to one or more network elements in the communication network. Traffic is looped through an optical line terminal using optical carrier cards, and virtual cross connects are provisioned in the communication network to create a communication path between the optical network terminal and the test optical network terminal. A method of troubleshooting a network element such as an optical network terminal is also provided. | 03-19-2009 |