Search

Paul F Ringseth

age ~65

from Bellevue, WA

Also known as:
  • Paul Ringseth
  • Paul Frederick Ringseth
16822 26Th St, Bellevue, WA 98008

Paul Ringseth Phones & Addresses

  • 16822 26Th St, Bellevue, WA 98008
  • Seattle, WA
  • Baring, WA
  • Kiona, WA
  • Redmond, WA
  • 8716 142Nd Ave NE, Redmond, WA 98052

Work

  • Company:
    Microsoft (bayesian magic)
    Jul 2011 to Aug 2013
  • Address:
    Redmond
  • Position:
    Principal sde

Education

  • Degree:
    BS, MS, Ph.D
  • School / High School:
    University of Washington
    1976 to 1986
  • Specialities:
    Mathematics, Physics, Economics, Statistics

Skills

Bayesian stats, nets, learning and magic • Online, dynamic, non-parametric learning • Quantitative Finance • Financial Econometrics • HPC Server Development • Concurrency God: cluster, MPI, NUMA, SM... • Messaging and dataflow patterns • SQL/NoSQL eventually consistent stuff • Compiler writer and DSL creator • Actuarial paraphernalia • Stochastic differential equations and Fe... • Harmonic analysis and spectral techniques • Bossing around grad students and ignorin... • Weird number theory, geometry, topology,... • Machine Learning (I implicitly mentioned... • Unsupervised Learning • Dimensionality Reduction • Compressive Sensing • Anomaly Detection • Bayesian networks • Particle Filters • Machine Learning • Graphical Models • Bayesian statistics • Statistical Graphics • Factor Analysis • Latent Class Analysis • Statistical Arbitrage • Market Microstructure • Compilers • C++ • Cluster • Software Engineering • CUDA • Parallel Computing • MPI • Servers • Win32 API • Messaging • High Performance Computing • Software Design • GPGPU • Multithreading • SQL • C# • Distributed Systems • Parallel Algorithms • Statistics

Awards

National Science Foundation • Mathematical Sciences Post-doctoral Fellowship • July 1988-July 1991 • Institute for Advanced Study • National Science Foundation Research Fellowship • 1987-1988 • University of Michigan • Harold Rackham Research Grant • Summer 1987 • Alfred P. Sloan Foundation • Doctoral Dissertation Fellowship • 1985-1986

Industries

Computer Software

Resumes

Paul Ringseth Photo 1

Paul Ringseth

view source
Position:
Principal SDE at Microsoft (Bayesian Magic), Owner at Paul F Ringseth, Inc.
Location:
Greater Seattle Area
Industry:
Computer Software
Work:
Microsoft (Bayesian Magic) - Redmond since Jul 2011
Principal SDE

Paul F Ringseth, Inc. - Bellevue since Feb 1996
Owner

Microsoft (HPC Server) - Redmond Mar 2011 - Jul 2011
Principal SDE

Microsoft (PCP goes GPGPU) - Redmond Jan 2009 - Mar 2011
Principal SDE

Microsoft (Parallel Computing Platform when it was just a startup) - Redmond Jan 2007 - Jan 2009
Principal SDE
Education:
University of Washington 1976 - 1986
BS, MS, Ph.D, Mathematics, Physics, Economics, Statistics
Skills:
Bayesian stats, nets, learning and magic
Online, dynamic, non-parametric learning
Quantitative Finance
Financial Econometrics
HPC Server Development
Concurrency God: cluster, MPI, NUMA, SMP, GPGPU
Messaging and dataflow patterns
SQL/NoSQL eventually consistent stuff
Compiler writer and DSL creator
Actuarial paraphernalia
Stochastic differential equations and Feynman-Kac
Harmonic analysis and spectral techniques
Bossing around grad students and ignoring undergrads
Weird number theory, geometry, topology, algebra
Machine Learning (I implicitly mentioned it, but search engines...)
Unsupervised Learning
Dimensionality Reduction
Compressive Sensing
Anomaly Detection
Bayesian networks
Particle Filters
Machine Learning
Graphical Models
Bayesian statistics
Statistical Graphics
Factor Analysis
Latent Class Analysis
Statistical Arbitrage
Market Microstructure
Compilers
C++
Cluster
Software Engineering
CUDA
Parallel Computing
MPI
Servers
Win32 API
Messaging
High Performance Computing
Software Design
GPGPU
Multithreading
SQL
C#
Distributed Systems
Parallel Algorithms
Statistics
Honor & Awards:
• National Science Foundation Mathematical Sciences Post-doctoral Fellowship July 1988-July 1991 • Institute for Advanced Study National Science Foundation Research Fellowship 1987-1988 • University of Michigan Harold Rackham Research Grant Summer 1987 • Alfred P. Sloan Foundation Doctoral Dissertation Fellowship 1985-1986

Us Patents

  • Extending Program Languages With Source-Program Attribute Tags

    view source
  • US Patent:
    6654953, Nov 25, 2003
  • Filed:
    Oct 9, 1998
  • Appl. No.:
    09/169383
  • Inventors:
    Christian Beaumont - Issaquah WA
    Jonathan Caves - Redmond WA
    Paul F. Ringseth - Redmond WA
  • Assignee:
    Microsoft Corporation - Redmond WA
  • International Classification:
    G06F 945
  • US Classification:
    717158, 717112, 717117, 717130, 717131, 717141, 717142, 717143, 717159
  • Abstract:
    Attribute tags embedded in the statements of a source program system extend a programming language. A compiler for the program includes an interface to detect the attribute tags and to call one of a number of attribute-provider programs external to the compiler. The provider programs modify the operation of the compiler, for example by injecting additional statements or other code into the program at one or more predetermined points remote from the attribute tag. The compiler interface lists the names of the attributes and locations of their associated provider programs.
  • Interface Between A Resource Manager And A Scheduler In A Process

    view source
  • US Patent:
    20100325636, Dec 23, 2010
  • Filed:
    Jun 18, 2009
  • Appl. No.:
    12/487084
  • Inventors:
    Paul F. Ringseth - Bellevue WA,
    William R. Messmer - Woodinville WA,
    Niklas Gustafsson - Bellevue WA,
    Genevieve Fernandes - Redmond WA,
    Marko Radmilac - Bellevue WA,
  • Assignee:
    MICROSOFT CORPORATION - Redmond WA
  • International Classification:
    G06F 9/50
    G06F 9/46
  • US Classification:
    718104, 718102
  • Abstract:
    An interface between a resource manager and schedulers in a process executing on a computer system allows the resource manager to manage the resources of the schedulers. The resource manager communicates with the schedulers using the interface to access statistical information from the schedulers. The statistical information describes the amount of use of the resources by the schedulers. The resource manager also communicates with the schedulers to dynamically allocate and reallocate resources among the schedulers in the same or different processes or computer systems in accordance with the statistical information.
  • Regaining Control Of A Processing Resource That Executes An External Execution Context

    view source
  • US Patent:
    20090300636, Dec 3, 2009
  • Filed:
    Jun 2, 2008
  • Appl. No.:
    12/131127
  • Inventors:
    Paul Ringseth - Bellevue WA,
    Genevieve Fernandes - Redmond WA,
  • Assignee:
    MICROSOFT CORPORATION - Redmond WA
  • International Classification:
    G06F 9/50
  • US Classification:
    718104
  • Abstract:
    A scheduler in a process of a computer system allows an external execution context to execute on a processing resource allocated to the scheduler. The scheduler provides control of the processing resource to the external execution context. The scheduler registers for a notification of an exit event associated with the external execution context. In response to receiving the notification that the exit event has occurred, the scheduler regains control of the processing resource and causes a task associated with an execution context controlled by the scheduler to be executed by the processing resource.
  • Fence Elision For Work Stealing

    view source
  • US Patent:
    20090320027, Dec 24, 2009
  • Filed:
    Jun 18, 2008
  • Appl. No.:
    12/141107
  • Inventors:
    Paul F. Ringseth - Redmond WA,
    Bill Messmer - Woodinville WA,
    Stephen Toub - Seattle WA,
  • Assignee:
    MICROSOFT CORPORATION - Redmond WA
  • International Classification:
    G06F 9/46
  • US Classification:
    718102
  • Abstract:
    Methods and systems for statistically eliding fences in a work stealing algorithm are disclosed. A data structure comprising a head pointer, tail pointer, barrier pointer and an advertising flag allows for dynamic load-balancing across processing resources in computer applications.
  • Managing Pools Of Dynamic Resources

    view source
  • US Patent:
    20100083272, Apr 1, 2010
  • Filed:
    Oct 1, 2008
  • Appl. No.:
    12/243859
  • Inventors:
    Joseph L. Hellerstein - Seattle WA,
    Eric Lynn Eilebrecht - Woodinville WA,
    Vance Morrison - Kirkland WA,
    Paul Ringseth - Bellevue WA,
  • Assignee:
    MICROSOFT CORPORATION - Redmond WA
  • International Classification:
    G06F 9/50
  • US Classification:
    718104
  • Abstract:
    Computer systems attempt to manage resource pools of a dynamic number of similar resources and work tasks in order to optimize system performance. Work requests are received into the resource pool having a dynamic number of resources instances. An instance-throughput curve is determined that relates a number of resource instances in the resource pool to throughput of the work requests. A slope of a point on the instance-throughput curve is estimated with stochastic gradient approximation. The number of resource instances for the resource pool is selected when the estimated slope of the instance-throughput curve is zero.
  • Meta-Scheduler With Meta-Contexts

    view source
  • US Patent:
    20100088704, Apr 8, 2010
  • Filed:
    Oct 3, 2008
  • Appl. No.:
    12/244966
  • Inventors:
    Paul F. Ringseth - Bellevue WA,
    William R. Messmer - Woodinville WA,
    Niklas Gustafsson - Bellevue WA,
    Joseph L. Hellerstein - Seattle WA,
  • Assignee:
    Microsoft Corporation - Redmond WA
  • International Classification:
    G06F 9/46
  • US Classification:
    718102
  • Abstract:
    A process in a computer system creates and uses a meta-scheduler with meta-contexts that execute on meta-virtual processors. The meta-scheduler includes a set of schedulers with scheduler-contexts that execute on virtual processors. The meta-scheduler schedules the scheduler-contexts on the meta-contexts and schedules the meta-contexts on the meta-virtual processors which execute on execution contexts associated with hardware threads.
  • Parallel Execution Of A Loop

    view source
  • US Patent:
    20100146245, Jun 10, 2010
  • Filed:
    Dec 4, 2008
  • Appl. No.:
    12/328262
  • Inventors:
    Huseyin S. Yildiz - Kenmore WA,
    Stephen S. Toub - Seattle WA,
    Paul Ringseth - Bellevue WA,
    John Duffy - Renton WA,
  • Assignee:
    Microsoft Corporation - Redmond WA
  • International Classification:
    G06F 9/30
  • US Classification:
    712220, 712E09016
  • Abstract:
    A method of executing a loop over an integer index range of indices in a parallel manner includes assigning a plurality of index subsets of the integer index range to a corresponding plurality of threads, and defining for each index subset a start point of the index subset, an end point of the index subset, and a boundary point of the index subset positioned between the start point and the end point of the index subset. A portion of the index subset between the start point and the boundary point represents a private range and the portion of the index subset between the boundary point and the end point represents a public range. Loop code is executed by each thread based on the index subset of the integer index range assigned to the thread.
  • Persistent Local Storage For Processor Resources

    view source
  • US Patent:
    20100153967, Jun 17, 2010
  • Filed:
    Dec 17, 2008
  • Appl. No.:
    12/336546
  • Inventors:
    Paul F. Ringseth - Bellevue WA,
    Rick Molloy - Redmond WA,
    Niklas Gustafsson - Bellevue WA,
    David Callahan - Seattle WA,
  • Assignee:
    Microsoft Corporation - Redmond WA
  • International Classification:
    G06F 9/46
  • US Classification:
    718106
  • Abstract:
    Local storage may be allocated for each processing resource in a process of a computer system. Each processing resource may be virtualized and may have a one-to-one or a many-to-one correspondence with with physical processors. The contents of each local storage persist across various execution contexts that are executed by a corresponding processing resource. Each local storage may be accessed without synchronization (e.g., locks) by each execution context that is executed on a corresponding processing resource. The local storages provide the ability to segment data and store and access the data without synchronization. The local storages may be used to implement lock-free techniques such as a generalized reduction where a set of values is combined through an associative operator.

Mylife

Paul Ringseth Photo 2

Paul Ringseth Bellevue W...

view source
Track down Paul Ringseth and other old friends and classmates. Reconnect ...

Facebook

Paul Ringseth Photo 3

Paul Ringseth

view source

Get Report for Paul F Ringseth from Bellevue, WA, age ~65
Control profile