Activity Feed

Medium 0 x1koj4krwcv2ikl8onsmwkzy4q4diel 2tsdd6jueiq2iqhqovsdwixzhcvhkoi6uzs2a25juam23u4dmz35oilr2amu3uj5uz3hx4jumqh532e2upadzacywi

Ryan T. created project WRENCH: Workflow Management System Simulation Workbench

Medium 0ef16a3e a443 41fa 8dea eac9fb7d88f3

WRENCH: Workflow Management System Simulation Workbench

WRENCH provides a software framework that makes it possible to simulate large-scale hypothetical scenarios quickly and accurately on a single computer, obviating the need for expensive and time-consuming trial and error experiments.

WRENCH enables scientists to make quick and informed choices when executing their workflows, software developers to implement more efficient software infrastructures to support workflows, and researchers to develop novel efficient algorithms to be embedded within these software infrastructures.

Medium 0 x1koj4krwcv2ikl8onsmwkzy4q4diel 2tsdd6jueiq2iqhqovsdwixzhcvhkoi6uzs2a25juam23u4dmz35oilr2amu3uj5uz3hx4jumqh532e2upadzacywi

Ryan T. created project Understanding MPI Reduction Algorithms

Medium 57792815 26b4 4558 8843 e3162071218d

Understanding MPI Reduction Algorithms

Collective communication functions defined by the Message Passing Interface are often used in high performance computing workflows to orchestrate collective actions amongst groups of processes. The reduce operation is useful when developers need to combine data stored at each MPI process. Current reduce implementations are highly optimized to minimize the operation’s execution time while maximizing network and process utilization. This paper explores three basic approaches: binomial, pipelined, and pipelined binary tree reductions. Both theoretical and empirical running times are discussed regarding these algorithms. Modern reduce algorithms utilize these basic approaches and captilize on their strengths. This paper also analyzes a new greedy pipelined reduction algorithm and empirically benchmarks it against current approaches. Findings show that binomial reductions are faster for smaller messages while pipelined and pipelined binary tree implementations are faster for larger messages. Furthermore, the greedy pipelined algorithm can be faster in all situations, however requires that an optimal message segment size be chosen.

Medium 0 x1koj4krwcv2ikl8onsmwkzy4q4diel 2tsdd6jueiq2iqhqovsdwixzhcvhkoi6uzs2a25juam23u4dmz35oilr2amu3uj5uz3hx4jumqh532e2upadzacywi

Ryan T. created project PushBox

Medium d9b15513 c426 4a25 b09b b14af73f71d7

PushBox

PushBox is a smart mailbox system that notifies users when mail has been received, removed, or possibly stolen by recording weight changes within the mailbox whenever it is opened. The hardware comprises of a Raspberry Pie unit, breadboard, USB food scale, battery unit, and custom built enclosure. Software for the entire system consists of a prototype android application, MySQL database hosted in the cloud, and a C program running on the raspberry pie. PushBox was a project submitted at the 2016 ATT Mobile App Hackathon in Honolulu. Team members: Joshua Nishiguchi, Aditya Kumar, Stephani Diep, Reed Shinsato, James Park, and Oliver Sou.

About

Featured Projects

See All

No groups to show at the moment.

No projects to show at the moment.

Medium big data
Featured
  • Followers 2115

Modern Code

Drive faster breakthroughs through faster code: Get more results on your hardware today and carry...

Medium networking
Featured
  • Followers 1939

Networking

Software-Defined Networking (SDN) and Network Functions Virtualization (NFV) are transforming the...

No users to show at the moment.