Brent A Swartz from 19141 65Th Ave, Eau Claire, WI 54729, age 61, Phone: 7157261405

Resumes

Senior Program Manager At 7 Delta, Inc.

view source

Position:

Senior Program Manager at 7 Delta, Inc.

Location:

Sandy, Utah

Industry:

Information Technology and Services

Work:

7 Delta, Inc. - Columbia, Maryland since Mar 2013
Senior Program Manager
7 Delta, Inc. - Washington D.C. Metro Area/ Salt Lake City Jun 2012 - Mar 2013
Deputy Program Manager
Systems Made Simple Inc. - Midvale, Utah May 2011 - Jun 2012
VLER IPT Facilitation's Team Lead/Project Manager
IHS Oct 2008 - Jan 2012
Project Manager
Environmax Mar 2006 - Oct 2008
Project Manager

Education:

PMI/Simplilearn 2012 - 2012
PMP, Project/Program Management Salt Lake Community College 2000 - 2010
PMP, Business, Hospitality and (PMP) Project Management Professional Salt Lake Community College 1997 - 2001
Bachelor's Degree, Computer & Information Sciences

Skills:

Project Management
Program Management
Program Facilitation
Team Management
Strategic Communications
Marketing Communications
Business Strategy
Business Analysis
Business Development
Business Process Improvement
Standardization
ISO 9001:2008
Promotions
Process Improvement
CMMI
DISC
Risk Management
Risk Assessment
Change Management
Strategic Hiring
Agile Methodologies
Oracle
Software Development
Business Process
Strategy
Requirements Analysis
ERP
PMP
XML
SDLC
Software Project Management
Event Management
MS Project
PMO
Analysis
Visio
Scrum
Project Portfolio Management

Interests:

Snow Boarding, Motocross, Camping, Hiking, Running, Boating, Skiing, Surfing, Diving and Socializing

Honor & Awards:

HMMS Program Coin, PMP

Brent Swartz

view source

Location:

19141 65Th Ave, Chippewa Falls, WI 54729

Industry:

Computer Software

Work:

Cray Inc.
Applications Analyst
Boeing
Senior Scientific and Engineering Applications Analyst
Lockheed Martin
Scientific Applications Consultant
Cube
Lead Technical Support Engineer
Cray Research
Quality Assurance Engineer

Education:

University of New Mexico Sep 2001
University of Wisconsin - Eau Claire May 1987
Bachelors, Bachelor of Science

Skills:

System Tuning
Gpgpu
Parallel Algorithms
Computational Physics
Cuda
Simd
Multi Core
Mpi
Openmp
Parallel Programming
Fortran
C
Pascal
C++
X3D
Java
Assembly
Perl
Awk
Gprof
Bash
Csh
Performance Tuning
Optimization
Porting
Application Optimisation
Openacc
Optimizations
High Performance Computing
Scientific Computing
Eclipse
Databases
Profiler

Languages:

English

Brent Swartz

view source

Name / Title

Company / Classification

Phones & Addresses

Brent P Swartz

SWARTZ FAMILY EYECARE, LLC

Brent P. Swartz

SWARTZ INVESTMENTS, LLC

Us Patents

Routing Data Packets With Hint Bit For Each Six Orthogonal Directions In Three Dimensional Torus Computer System Set To Avoid Nodes In Problem List
view source
US Patent:

7644254, Jan 5, 2010
Filed:

Apr 18, 2007
Appl. No.:

11/736811
Inventors:

David L. Darrington - Rochester MN, US
Patrick Joseph McCarthy - Rochester MN, US
Amanda Peters - Rochester MN, US
Albert Sidelnik - St. Paul MN, US
Brian Edward Smith - Rochester MN, US
Brent Allen Swartz - Chippewa Falls WI, US
Assignee:

International Business Machines Corporation - Armonk NY
International Classification:

G06F 15/173
US Classification:

712 10, 709230
Abstract:

A method and apparatus for dynamically rerouting node processes on the compute nodes of a massively parallel computer system using hint bits to route around failed nodes or congested networks without restarting applications executing on the system. When a node has a failure or there are indications that it may fail, the application software on the system is suspended while the data on the failed node is moved to a backup node. The torus network traffic is routed around the failed node and traffic for the failed node is rerouted to the backup node. The application can then resume operation without restarting from the beginning.

Method And Apparatus For Routing Data In An Inter-Nodal Communications Lattice Of A Massively Parallel Computer System By Dynamically Adjusting Local Routing Strategies
view source
US Patent:

7680048, Mar 16, 2010
Filed:

Oct 6, 2006
Appl. No.:

11/539329
Inventors:

Charles Jens Archer - Rochester MN, US
Roy Glenn Musselman - Rochester MN, US
Amanda Peters - Rochester MN, US
Kurt Walter Pinnow - Rochester MN, US
Brent Allen Swartz - Chippewa Falls WI, US
Brian Paul Wallenfelt - Eden Prairie MN, US
Assignee:

International Business Machiens Corporation - Armonk NY
International Classification:

G01R 31/08
G06F 11/00
H04L 12/28
H04L 12/56
US Classification:

370235, 370400
Abstract:

A massively parallel computer system contains an inter-nodal communications network of node-to-node links. Each node implements a respective routing strategy for routing data through the network, the routing strategies not necessarily being the same in every node. The routing strategies implemented in the nodes are dynamically adjusted during application execution to shift network workload as required. Preferably, adjustment of routing policies in selective nodes is performed at synchronization points. The network may be dynamically monitored, and routing strategies adjusted according to detected network conditions.

Method And Apparatus For Routing Data In An Inter-Nodal Communications Lattice Of A Massively Parallel Computer System By Employing Bandwidth Shells At Areas Of Overutilization
view source
US Patent:

7706275, Apr 27, 2010
Filed:

Feb 7, 2007
Appl. No.:

11/672315
Inventors:

Charles Jens Archer - Rochester MN, US
Roy Glenn Musselman - Rochester MN, US
Amanda Peters - Rochester MN, US
Kurt Walter Pinnow - Rochester MN, US
Brent Allen Swartz - Chippewa Falls WI, US
Brian Paul Wallenfelt - Eden Prairie MN, US
Assignee:

International Business Machines Corporation - Armonk NY
International Classification:

G01R 31/08
US Classification:

370235, 370389, 709240
Abstract:

A massively parallel computer system contains an inter-nodal communications network of node-to-node links. An automated routing strategy routes packets through one or more intermediate nodes of the network to reach a final destination. The default routing strategy is altered responsive to detection of overutilization of a particular path of one or more links, and at least some traffic is re-routed by distributing the traffic among multiple paths (which may include the default path). An alternative path may require a greater number of link traversals to reach the destination node.

Method And Apparatus For Routing Data In An Inter-Nodal Communications Lattice Of A Massively Parallel Computer System By Routing Through Transporter Nodes
view source
US Patent:

7835284, Nov 16, 2010
Filed:

Oct 6, 2006
Appl. No.:

11/539300
Inventors:

Charles Jens Archer - Rochester MN, US
Roy Glenn Musselman - Rochester MN, US
Amanda Peters - Rochester MN, US
Kurt Walter Pinnow - Rochester MN, US
Brent Allen Swartz - Chippewa Falls WI, US
Brian Paul Wallenfelt - Eden Prairie MN, US
Assignee:

International Business Machines Corporation - Armonk NY
International Classification:

G01R 31/08
G06F 11/00
H04L 12/50
H04Q 11/00
US Classification:

370235, 370386
Abstract:

A massively parallel computer system contains an inter-nodal communications network of node-to-node links. An automated routing strategy routes packets through one or more intermediate nodes of the network to reach a destination. Some packets are constrained to be routed through respective designated transporter nodes, the automated routing strategy determining a path from a respective source node to a respective transporter node, and from a respective transporter node to a respective destination node. Preferably, the source node chooses a routing policy from among multiple possible choices, and that policy is followed by all intermediate nodes. The use of transporter nodes allows greater flexibility in routing.

Method And Apparatus For Routing Data In An Inter-Nodal Communications Lattice Of A Massively Parallel Computer System By Semi-Randomly Varying Routing Policies For Different Packets
view source
US Patent:

7839786, Nov 23, 2010
Filed:

Oct 6, 2006
Appl. No.:

11/539270
Inventors:

Charles Jens Archer - Rochester MN, US
Roy Glenn Musselman - Rochester MN, US
Amanda Peters - Rochester MN, US
Kurt Walter Pinnow - Rochester MN, US
Brent Allen Swartz - Chippewa Falls WI, US
Brian Paul Wallenfelt - Eden Prairie MN, US
Assignee:

International Business Machines Corporation - Armonk NY
International Classification:

G01R 31/08
G06F 11/00
H04L 12/50
H04L 12/28
H04L 12/56
H04Q 11/00
US Classification:

370235, 370386, 370400
Abstract:

A massively parallel computer system contains an inter-nodal communications network of node-to-node links. Nodes vary a choice of routing policy for routing data in the network in a semi-random manner, so that similarly situated packets are not always routed along the same path. Semi-random variation of the routing policy tends to avoid certain local hot spots of network activity, which might otherwise arise using more consistent routing determinations. Preferably, the originating node chooses a routing policy for a packet, and all intermediate nodes in the path route the packet according to that policy. Policies may be rotated on a round-robin basis, selected by generating a random number, or otherwise varied.

Method And Apparatus For Routing Data In An Inter-Nodal Communications Lattice Of A Massively Parallel Computer System By Dynamic Global Mapping Of Contended Links
view source
US Patent:

8031614, Oct 4, 2011
Filed:

Oct 6, 2006
Appl. No.:

11/539248
Inventors:

Charles Jens Archer - Rochester MN, US
Roy Glenn Musselman - Rochester MN, US
Amanda Peters - Rochester MN, US
Kurt Walter Pinnow - Rochester MN, US
Brent Allen Swartz - Chippewa Falls WI, US
Brian Paul Wallenfelt - Eden Prairie MN, US
Assignee:

International Business Machines Corporation - Armonk NY
International Classification:

G01R 31/08
US Classification:

370238, 370390, 370235, 370230, 709213, 709227, 709245
Abstract:

A massively parallel nodal computer system periodically collects and broadcasts usage data for an internal communications network. A node sending data over the network makes a global routing determination using the network usage data. Preferably, network usage data comprises an N-bit usage value for each output buffer associated with a network link. An optimum routing is determined by summing the N-bit values associated with each link through which a data packet must pass, and comparing the sums associated with different possible routes.

Tracking Network Contention
view source
US Patent:

8055879, Nov 8, 2011
Filed:

Dec 13, 2007
Appl. No.:

11/955474
Inventors:

Charles J. Archer - Rochester MN, US
Amanda Peters - Rochester MN, US
Brian E. Smith - Rochester MN, US
Brent A. Swartz - Chippewa Falls WI, US
Assignee:

International Business Machines Corporation - Armonk NY
International Classification:

H04L 12/28
G06F 15/16
G06F 15/00
US Classification:

712 10, 709232, 370406
Abstract:

Methods, apparatus, and product for tracking network contention on links among compute nodes of an operational group in a point-to-point data communications network of a parallel computer are disclosed. In embodiments of the present invention, each compute node is connected to an adjacent compute node in the point-to-point data communications network through a link. Tracking network contention according to embodiments of the present invention includes maintaining, by a network contention module on each compute node in the operational group, a local contention counter for each compute node, each local contention counter representing network contention on links among the compute nodes originating from the compute node; and maintaining a global contention counter, the global contention counter representing network contention currently on all links among the compute nodes in the operational group.

Routing Performance Analysis And Optimization Within A Massively Parallel Computer
view source
US Patent:

8423987, Apr 16, 2013
Filed:

Jan 30, 2007
Appl. No.:

11/668691
Inventors:

Charles Jens Archer - Rochester MN, US
Amanda Peters - Rochester MN, US
Kurt Walter Pinnow - Rochester MN, US
Brent Allen Swartz - Chippewa Falls WI, US
Assignee:

International Business Machines Corporation - Armonk NY
International Classification:

G06F 9/45
US Classification:

717158, 717151, 717153, 717154
Abstract:

An apparatus, program product and method optimize the operation of a massively parallel computer system by, in part, receiving actual performance data concerning an application executed by the plurality of interconnected nodes, and analyzing the actual performance data to identify an actual performance pattern. A desired performance pattern may be determined for the application, and an algorithm may be selected from among a plurality of algorithms stored within a memory, the algorithm being configured to achieve the desired performance pattern based on the actual performance data.