BackgroundCheck.run
Search For

Ahmad A Faraj2021 Century Hills Ln, Rochester, MN 55906

Ahmad Faraj Phones & Addresses

2021 Century Hills Ln, Rochester, MN 55906    507-5291240   

995 Parkview Ct, Tallahassee, FL 32311    850-5623885   

4389 Cool Emerald Dr, Tallahassee, FL 32303    850-5623885    850-5622734   

Westchester, IL   

Darien, IL   

4389 Cool Emerald Dr, Tallahassee, FL 32303    850-3240678   

Work

Position: Protective Service Occupations

Education

Degree: Graduate or professional degree

Emails

Mentions for Ahmad A Faraj

Career records & work history

Lawyers & Attorneys

Ahmad Faraj Photo 1

Ahmad Faraj - Lawyer

Specialties:
Administrative & Regulatory Law, Business Law, Criminal Law, Negligence Law, Real Property Law, Appellate Practice, Consumer Law, Criminal Law
ISLN:
1000469936
Admitted:
2020

Ahmad Faraj resumes & CV records

Resumes

Ahmad Faraj Photo 32

Ahmad Faraj

Ahmad Faraj Photo 33

Ahmad Faraj

Publications & IP owners

Us Patents

Broadcasting A Message In A Parallel Computer

US Patent:
7991857, Aug 2, 2011
Filed:
Mar 24, 2008
Appl. No.:
12/053902
Inventors:
Jeremy E. Berg - Rochester MN, US
Ahmad A. Faraj - Rochester MN, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
H04L 12/437
G06F 15/16
US Classification:
709220, 709203, 709228, 370216
Abstract:
Methods, systems, and products are disclosed for broadcasting a message in a parallel computer. The parallel computer includes a plurality of compute nodes connected together using a data communications network. The data communications network optimized for point to point data communications and is characterized by at least two dimensions. The compute nodes are organized into at least one operational group of compute nodes for collective parallel operations of the parallel computer. One compute node of the operational group assigned to be a logical root. Broadcasting a message in a parallel computer includes: establishing a Hamiltonian path along all of the compute nodes in at least one plane of the data communications network and in the operational group; and broadcasting, by the logical root to the remaining compute nodes, the logical root's message along the established Hamiltonian path.

Broadcasting Collective Operation Contributions Throughout A Parallel Computer

US Patent:
8122228, Feb 21, 2012
Filed:
Mar 24, 2008
Appl. No.:
12/053842
Inventors:
Ahmad Faraj - Rochester MN, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 15/76
US Classification:
712 28, 709201
Abstract:
Methods, systems, and products are disclosed for broadcasting collective operation contributions throughout a parallel computer. The parallel computer includes a plurality of compute nodes connected together through a data communications network. Each compute node has a plurality of processors for use in collective parallel operations on the parallel computer. Broadcasting collective operation contributions throughout a parallel computer according to embodiments of the present invention includes: transmitting, by each processor on each compute node, that processor's collective operation contribution to the other processors on that compute node using intra-node communications; and transmitting on a designated network link, by each processor on each compute node according to a serial processor transmission sequence, that processor's collective operation contribution to the other processors on the other compute nodes using inter-node communications.

Performing An Allreduce Operation On A Plurality Of Compute Nodes Of A Parallel Computer

US Patent:
8161268, Apr 17, 2012
Filed:
May 21, 2008
Appl. No.:
12/124756
Inventors:
Ahmad Faraj - Rochester MN, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 15/80
G06F 9/30
G06F 9/302
US Classification:
712 30, 712221
Abstract:
Methods, apparatus, and products are disclosed for performing an allreduce operation on a plurality of compute nodes of a parallel computer. Each compute node includes at least two processing cores. Each processing core has contribution data for the allreduce operation. Performing an allreduce operation on a plurality of compute nodes of a parallel computer includes: establishing one or more logical rings among the compute nodes, each logical ring including at least one processing core from each compute node; performing, for each logical ring, a global allreduce operation using the contribution data for the processing cores included in that logical ring, yielding a global allreduce result for each processing core included in that logical ring; and performing, for each compute node, a local allreduce operation using the global allreduce results for each processing core on that compute node.

Providing Point To Point Communications Among Compute Nodes In A Global Combining Network Of A Parallel Computer

US Patent:
8194678, Jun 5, 2012
Filed:
Jul 21, 2008
Appl. No.:
12/176840
Inventors:
Charles J. Archer - Rochester MN, US
Ahmad A. Faraj - Rochester MN, US
Todd A. Inglett - Rochester MN, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
H04L 12/28
US Classification:
3703953, 370409
Abstract:
Methods, apparatus, and products are disclosed for providing point to point data communications among compute nodes in a global combining network of a parallel computer that include: determining a class route identifier available for all of the nodes along a communications path from an origin node to a target node; configuring network hardware of each node along the communications path with routing instructions in dependence upon the available class route identifier and the network's topology; transmitting, by the origin node along the communications path, a network packet to the target node, including encoding the available class route identifier in the network packet; and routing, by the network hardware of each node along the communications path, the network packet to the target node in dependence upon the routing instructions for each node and the available class route identifier.

Providing Nearest Neighbor Point-To-Point Communications Among Compute Nodes Of An Operational Group In A Global Combining Network Of A Parallel Computer

US Patent:
8296457, Oct 23, 2012
Filed:
Aug 2, 2007
Appl. No.:
11/832955
Inventors:
Charles J. Archer - Rochester MN, US
Ahmad A. Faraj - Rochester MN, US
Todd A. Inglett - Rochester MN, US
Joseph D. Ratterman - Rochester MN, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 15/173
G06F 15/16
G06F 15/00
G06Q 10/00
US Classification:
709238, 709250, 705 1, 712 3
Abstract:
Methods, apparatus, and products are disclosed for providing nearest neighbor point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer, each compute node connected to each adjacent compute node in the global combining network through a link, that include: identifying each link in the global combining network for each compute node of the operational group; designating one of a plurality of point-to-point class routing identifiers for each link such that no compute node in the operational group is connected to two adjacent compute nodes in the operational group with links designated for the same class routing identifiers; and configuring each compute node of the operational group for point-to-point communications with each adjacent compute node in the global combining network through the link between that compute node and that adjacent compute node using that link's designated class routing identifier.

Performing An Allreduce Operation On A Plurality Of Compute Nodes Of A Parallel Computer

US Patent:
8375197, Feb 12, 2013
Filed:
May 21, 2008
Appl. No.:
12/124763
Inventors:
Ahmad Faraj - Rochester MN, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 15/80
G06F 9/30
G06F 9/302
US Classification:
712 30, 712221
Abstract:
Methods, apparatus, and products are disclosed for performing an allreduce operation on a plurality of compute nodes of a parallel computer, each node including at least two processing cores, that include: performing, for each node, a local reduction operation using allreduce contribution data for the cores of that node, yielding, for each node, a local reduction result for one or more representative cores for that node; establishing one or more logical rings among the nodes, each logical ring including only one of the representative cores from each node; performing, for each logical ring, a global allreduce operation using the local reduction result for the representative cores included in that logical ring, yielding a global allreduce result for each representative core included in that logical ring; and performing, for each node, a local broadcast operation using the global allreduce results for each representative core on that node.

Broadcasting A Message In A Parallel Computer

US Patent:
8422402, Apr 16, 2013
Filed:
Apr 1, 2008
Appl. No.:
12/060492
Inventors:
Charles J. Archer - Rochester MN, US
Ahmad A. Faraj - Rochester TX, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
H04L 12/28
H04L 12/56
US Classification:
370256, 370390
Abstract:
Methods, systems, and products are disclosed for broadcasting a message in a parallel computer that includes: transmitting, by the logical root to all of the nodes directly connected to the logical root, a message; and for each node except the logical root: receiving the message; if that node is the physical root, then transmitting the message to all of the child nodes except the child node from which the message was received; if that node received the message from a parent node and if that node is not a leaf node, then transmitting the message to all of the child nodes; and if that node received the message from a child node and if that node is not the physical root, then transmitting the message to all of the child nodes except the child node from which the message was received and transmitting the message to the parent node.

Providing Full Point-To-Point Communications Among Compute Nodes Of An Operational Group In A Global Combining Network Of A Parallel Computer

US Patent:
8423663, Apr 16, 2013
Filed:
Aug 6, 2007
Appl. No.:
11/834159
Inventors:
Charles J. Archer - Rochester MN, US
Ahmad A. Faraj - Rochester MN, US
Todd A. Inglett - Rochester MN, US
Joseph D. Ratterman - Rochester MN, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 15/173
G06F 15/16
H04L 12/28
H04L 12/66
H04L 12/56
US Classification:
709238, 709239, 709240, 709242, 709250, 370351, 370352, 370392
Abstract:
Methods, apparatus, and products are disclosed for providing full point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer, each compute node connected to each adjacent compute node in the global combining network through a link, that include: receiving a network packet in a compute node, the network packet specifying a destination compute node; selecting, in dependence upon the destination compute node, at least one of the links for the compute node along which to forward the network packet toward the destination compute node; and forwarding the network packet along the selected link to the adjacent compute node connected to the compute node through the selected link.

NOTICE: You may not use BackgroundCheck or the information it provides to make decisions about employment, credit, housing or any other purpose that would require Fair Credit Reporting Act (FCRA) compliance. BackgroundCheck is not a Consumer Reporting Agency (CRA) as defined by the FCRA and does not provide consumer reports.