Search

Kelvin D Nilsen

from Draper, UT
Age ~65
Get Report
Also known as:
Kevin D Nilsen, Kevin D Farnsworth
Related to:
Kami L Nilsen, 35Amanda Holmes, 44Emily Bradley, 49Rebecca Stratford, 40Lorina Webb, 40Edward Johnson, 42
Connected to:
Adeline Nilsen, 109Anna I Nilsen, 92Beatrice L Nilsen, 93Berit A Nilsen, 92Brit A Nilsen, 36Darlene M Nilsen, 72Eirik T Nilsen, 35Eric J Nilsen, 63Erika R Nilsen, 54Gudrun R Nilsen, 108

Kelvin Nilsen Phones & Addresses

  • Draper, UT
  • Provo, UT
  • Snoqualmie, WA
  • Rochester, MN
  • 1446 1020 E, American Fork, UT 84003
  • Tucson, AZ
  • Ames, IA

Work

Company: Aonix Position: Chief technology officer-java

Education

Degree: High school graduate or higher

Skills

Uml • Configuration Management • System Architecture • Software Development • Software Engineering • Systems Engineering • C • Java • Embedded Systems • Cloud Computing • Integration • Enterprise Architecture • Linux • Architecture • Engineering Management • Enterprise Software • Embedded Software • Software Design • Agile Methodologies • Requirements Analysis • System Design • Requirements Management • Software Project Management • Rtos • Architectures • C++ • Distributed Systems • Testing • Object Oriented Design • Programming • Python • Device Drivers • Algorithms • Unix • Soa • Xml • Avionics • Real Time • Simulations • Security • Systems Design

Industries

Computer Software

Resumes

Resumes

Kelvin Nilsen Photo 1

Kelvin Nilsen

View page
Location:
Provo, UT
Industry:
Computer Software
Work:
Aonix
Chief Technology Officer-Java
Skills:
Uml
Configuration Management
System Architecture
Software Development
Software Engineering
Systems Engineering
C
Java
Embedded Systems
Cloud Computing
Integration
Enterprise Architecture
Linux
Architecture
Engineering Management
Enterprise Software
Embedded Software
Software Design
Agile Methodologies
Requirements Analysis
System Design
Requirements Management
Software Project Management
Rtos
Architectures
C++
Distributed Systems
Testing
Object Oriented Design
Programming
Python
Device Drivers
Algorithms
Unix
Soa
Xml
Avionics
Real Time
Simulations
Security
Systems Design

Business Records

Name / Title
Company / Classification
Phones & Addresses
Kelvin Nilsen
COO
Newmonics Inc
Wet Corn Milling
877 S. Alvernon #100, Tucson, AZ 85710
Kelvin Nilsen
COO
Newmonics Inc
Wet Corn Milling
877 S. Alvernon #100, Tucson, AZ 85710

Publications

Us Patents

Context Switching Locations For Compiler-Assisted Context Switching

View page
US Patent:
20210208886, Jul 8, 2021
Filed:
Jan 6, 2020
Appl. No.:
16/734739
Inventors:
- Armonk NY, US
Kelvin Don Nilsen - Rochester MN, US
International Classification:
G06F 9/30
G06F 16/901
G06F 8/41
Abstract:
Generating context switching locations for compiler-assisted context switching. A set of possible locations is determined for preferred preemption points in a set of threads based on (i) an identification of a set of candidate markers for preferred preemption points and (ii) a type of characteristic that is associated with a possible location included in the set of possible locations. A modified set of possible locations is generated in a data structure based on the type of characteristic, wherein the modified set of possible locations indicate one or more preferred preemption points in the set of threads.

Multi-Threaded Pause-Less Replicating Garbage Collection

View page
US Patent:
20200409841, Dec 31, 2020
Filed:
Jun 26, 2019
Appl. No.:
16/452971
Inventors:
- Armonk NY, US
Kelvin Don Nilsen - Rochester MN, US
International Classification:
G06F 12/02
G06F 3/06
G06F 9/50
Abstract:
A method and a system for garbage collection on a system. The method includes initiating a garbage collection process on a system by a garbage collector. The garbage collector includes one or more garbage collector threads. The method also includes marking a plurality of referenced objects using the garbage collector threads and one or more application threads during a preemption point. The method includes replicating the referenced objects using the garbage collector threads and marking for replication any newly discovered referenced objects found by scanning the application thread stack from a low-water mark. The method also includes replicating the newly discovered referenced objects and overwriting any reference to the old memory location.

Hybrid Garbage Collection

View page
US Patent:
20200327051, Oct 15, 2020
Filed:
Apr 15, 2019
Appl. No.:
16/384532
Inventors:
- Armonk NY, US
Kelvin D. Nilsen - Rochester MN, US
International Classification:
G06F 12/02
G06F 9/48
G06F 9/448
Abstract:
A hybrid hybrid garbage collection methodology may be used to perform garbage collection in a manner that consolidates live objects from an evacuation region of memory into a consolidation region of memory, while also reclaiming reclaimable objects from the consolidation region, such that upon completion of a garbage collection pass, reclaimable objects from both the evacuation and consolidation regions are reclaimed while live objects from both the evacuation and consolidation regions are consolidated in the consolidation region.

Compiling Application With Multiple Function Implementations For Garbage Collection

View page
US Patent:
20200327052, Oct 15, 2020
Filed:
Apr 15, 2019
Appl. No.:
16/384529
Inventors:
- Armonk NY, US
Kelvin D. Nilsen - Rochester MN, US
International Classification:
G06F 12/02
G06F 8/41
Abstract:
Functions of an application may include multiple implementations that have corresponding behaviors but perform different garbage collection-related activities such that the different implementations may be executed during different garbage collection phases to reduce overall garbage collection overhead during application execution.

Real-Time Replicating Garbage Collection

View page
US Patent:
20200310963, Oct 1, 2020
Filed:
Mar 28, 2019
Appl. No.:
16/368253
Inventors:
- Armonk NY, US
Kelvin Don Nilsen - Rochester MN, US
International Classification:
G06F 12/02
G06F 9/50
G06F 9/48
G06F 16/27
Abstract:
A method and a system for garbage collection on a system. The method includes initiating a garbage collection process on a system by a garbage collector. The garbage collector includes one or more garbage collector threads. The method also includes marking a plurality of referenced objects using the garbage collector threads and one or more application threads during a preemption point. The method includes replicating the referenced objects using the garbage collector threads and marking for replication any newly discovered referenced objects found by scanning the application thread stack from a low-water mark. The method also includes replicating the newly discovered referenced objects and overwriting any reference to the old memory location.

Placement Of Explicit Preemption Points Into Compiled Code

View page
US Patent:
20200272444, Aug 27, 2020
Filed:
Feb 22, 2019
Appl. No.:
16/282807
Inventors:
- ARMONK NY, US
KELVIN D. NILSEN - ROCHESTER MN, US
International Classification:
G06F 8/41
Abstract:
Improvements in the placement of explicit preemption points into compiled code are disclosed. A control flow graph is created, from executable code, that includes every control path in a function. From the control flow graph, an estimated execution time for each control path is determined. For each control path, it is determined whether an estimated execution time of a control path exceeds a preemption latency parameter, wherein the preemption latency parameter is a maximum allowable time between preemption points. When it is determined that the estimated execution time of a particular control path violates the preemption latency parameter, an explicit preemption point is placed into the executable code that satisfies the preemption latency parameter.

Compiler-Optimized Context Switching

View page
US Patent:
20200264880, Aug 20, 2020
Filed:
Feb 15, 2019
Appl. No.:
16/276740
Inventors:
- Armonk NY, US
Kelvin D. Nilsen - Rochester MN, US
International Classification:
G06F 9/30
G06F 8/41
G06F 9/48
G06F 12/0864
Abstract:
Compiler-optimized context switching may include receiving an instruction indicating a preferred preemption point comprising an instruction address; storing the preferred preemption point in a data structure; determining, based on the data structure, that the preferred preemption point has been reached by a first thread; determining that preemption of the first thread for a second thread has been requested; and performing a context switch to the second thread.

Precise Accounting Of Processor Time For Multi-Threaded Time-Critical Applications

View page
US Patent:
20200174827, Jun 4, 2020
Filed:
Nov 29, 2018
Appl. No.:
16/203735
Inventors:
- ARMONK NY, US
KELVIN D. NILSEN - ROCHESTER MN, US
International Classification:
G06F 9/48
G06F 9/30
Abstract:
Methods and apparatus for processor time accounting for a thread executing in a multi-threaded environment are disclosed. A thread executing in an operating system receives from an operating system an allotment of time for use of a processor, and performs timed computations using the processor. Iteratively or after completing the computations, the thread determines an amount of time used by the thread based on a thread utilization counter initialized by the operating. The thread makes this determination through a user-level library function call rather than a call to the operating. The thread obtains an amount of time remaining in the allotment of time by comparing the thread utilization counter to a current CPU time using a user-level library function call.
Control profile
Kelvin D Nilsen from Draper, UT, age ~65 Get Report