Computation Offloading Decisions for Reducing Completion Time

August 20, 2016 Β· Declared Dead Β· πŸ› Consumer Communications and Networking Conference

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Salvador Melendez, Michael P. McGarry arXiv ID 1608.05839 Category cs.DC: Distributed Computing Citations 59 Venue Consumer Communications and Networking Conference Last Checked 5 months ago
Abstract
We analyze the conditions in which offloading computation reduces completion time. We extend the existing literature by deriving an inequality (Eq. 4) that relates computation offloading system parameters to the bits per instruction ratio of a computational job. This ratio is the inverse of the arithmetic intensity. We then discuss how this inequality can be used to determine the computations that can benefit from offloading as well as the computation offloading systems required to make offloading beneficial for particular computations.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Distributed Computing

Died the same way β€” πŸ‘» Ghosted