Search

Paul Nowoczynski Phones & Addresses

  • Maplewood, NJ
  • 131 Jackson St APT 2A, Brooklyn, NY 11211
  • 718 43Rd Ave, San Francisco, CA 94121
  • 5135 Liberty Ave, Pittsburgh, PA 15224 (412) 918-1545
  • 424 Noble St, Pittsburgh, PA 15232 (412) 687-7997
  • 4034 Calico Dr, Erie, PA 16506 (814) 838-5198

Work

Company: Envoy group Nov 2018 Position: Freelance systems programmer

Education

Degree: Bachelors, Bachelor of Science School / High School: University of Pittsburgh 1992 to 1996 Specialities: Information Science

Skills

High Performance Computing • Linux • File Systems • Storage • Distributed Systems • Programming • C • Perl • Cluster • Distributed File Systems • High Availability • Parallel Computing • Parallel Programming • Supercomputing

Industries

Computer Software

Resumes

Resumes

Paul Nowoczynski Photo 1

Freelance Systems Programmer

View page
Location:
New York, NY
Industry:
Computer Software
Work:
Envoy Group
Freelance Systems Programmer

Digitalocean
Engineer

Ddn Storage
Principal Architect

Pittsburgh Supercomputing Center May 2002 - Jul 2012
Parallel and Distributed Storage Systems Architect

Ddn Storage May 2002 - Jul 2012
Senior Software Engineer
Education:
University of Pittsburgh 1992 - 1996
Bachelors, Bachelor of Science, Information Science
Skills:
High Performance Computing
Linux
File Systems
Storage
Distributed Systems
Programming
C
Perl
Cluster
Distributed File Systems
High Availability
Parallel Computing
Parallel Programming
Supercomputing

Publications

Wikipedia

Creati Is Crucifixi

View page

Paul Nowoczynski Nathan Martin Michael Laughlin Chad Schlegel Ryan Unks ... Paul Nowoczynski - guitar (original member); Nathan Martin - vocals (original ...

Us Patents

High Efficiency, High Performance System For Writing Data From Applications To A Safe File System

View page
US Patent:
8316288, Nov 20, 2012
Filed:
Nov 7, 2008
Appl. No.:
12/734201
Inventors:
Paul Nowoczynski - Pittsburgh PA, US
Nathan Stone - Pittsburgh PA, US
Jared Yanovich - Pittsburgh PA, US
Jason Sommerfield - Pittsburgh PA, US
Assignee:
Carnegie Mellon University - Pittsburgh PA
International Classification:
G06F 11/00
US Classification:
714801
Abstract:
Systems and methods for increasing the efficiency of data storage processes for high performance, high core number computing systems. In one embodiment, the systems of the present invention perform sequential I/O whenever possible. To achieve a high degree of sequentiality, the block allocation scheme is determined by the next available block on the next available disk. This simple, non-deterministic data placement method is extremely effective for providing sequential data streams to the spindle by minimizing costly seeks. The sequentiality of the allocation scheme is not affected by the number of clients, the degree of randomization within the incoming data streams, the logical byte addresses of incoming request's file extents, or the RAID attributes (i. e. , parity position) of the block.

Method For Efficient Erasure Coded Group Management In Shared Nothing Storage Clusters

View page
US Patent:
20210159914, May 27, 2021
Filed:
Nov 25, 2020
Appl. No.:
17/105286
Inventors:
Paul Joseph Nowoczynski - Brooklyn NY, US
International Classification:
H03M 13/05
G06F 11/10
H03M 13/00
Abstract:
A method that achieves high availability by employing distributed erasure coding instead of distributed replication and preserves and applies the positive attributes of distributed replication to that of distributed erasure coding. The results are improvements and simplifications to the otherwise difficult internal management processes found in distributed, shared-nothing, erasure coding systems. The key positive attributes of the distributed replication method are processing of a user's write request without requiring the presence of some set of adjacent blocks (ie a read-modify-write) and the ability of storage endpoints to perform garbage collection tasks with complete autonomy of one another. The distributed block storage system simultaneously captures the capacity advantages of erasure coding and the positive attributes of fault tolerance management found in data replication.

Reducing Metadata In A Write-Anywhere Storage System

View page
US Patent:
20150347434, Dec 3, 2015
Filed:
Aug 12, 2015
Appl. No.:
14/824972
Inventors:
- Chatsworth CA, US
Paul J. Nowoczynski - Brooklyn NY, US
Pavan Kumar Kumar Uppu - Laurel MD, US
Donald J. Molaro - Cupertino CA, US
Michael J. Piszczek - Laurel MD, US
John G. Manning - Ellicott City MD, US
International Classification:
G06F 17/30
G06F 12/08
Abstract:
Systems and methods for reducing metadata in a write-anywhere storage system are disclosed herein. The system includes a plurality of clients coupled with a plurality of storage nodes, each storage node having a plurality of primary storage devices coupled thereto. A memory management unit including cache memory is included in the client. The memory management unit serves as a cache for data produced by the clients before the data is stored in the primary storage. The cache includes an extent cache, an extent index, a commit cache and a commit index. The movement of data and metadata is by an interval tree. Methods for reducing data in the interval tree increase data storage and data retrieval performance of the system.

Method And System For Data Transfer Between Compute Clusters And File System

View page
US Patent:
20140351300, Nov 27, 2014
Filed:
Oct 3, 2013
Appl. No.:
14/045170
Inventors:
- Chatsworth CA, US
JASON MICAH COPE - HIGHLAND MD, US
PAUL NOWOCZYNSKI - BROOKLYN NY, US
MICHAEL PISZCZEK - LAUREL MD, US
Assignee:
DATADIRECT NETWORKS, INC. - Chatsworth CA
International Classification:
G06F 17/30
US Classification:
707827
Abstract:
A data migrating system and method are provided in which a Burst Buffer Network Aggregator (BBNA) process is configured either on the File Servers or on the File System's dedicated I/O nodes to coalesce data fragments stored in participating Burst Buffer nodes under the direction of a primary BB node appointed by a data generating entity prior to transfer of the full data stripe into the File System. The “write” request in the form of a full data stripe is distributed into a plurality of data fragments among participating BB nodes along with corresponding metadata. The primary BB node gathers the metadata from the participating BB nodes, sends the metadata list to the BBNA unit, responsive to which the BBNA unit allocates a buffer sufficient to store the full data stripe, and transfers data fragments from participating BB nodes into the full data stripe buffer, thereby coalescing the data fragments into the full data stripe, which is subsequently transferred from the buffer in the BBNA unit into the File System.
Paul J Nowoczynski from Maplewood, NJ, age ~50 Get Report