dbarnes

OSX Sierra + Titan Xp eGPU. Tensorflow 1.2.1. + CUDA 8 + cuDNN 6

This gist summarises the tensorflow related steps I took to get the above combo working.

When its all tested in c++ I'll update the instructions fully (and add anything I forgot below).

But in summary ( with the current master dd06643cf098ed362212ce0f76ee746951466e81 ):

I have uploaded the pip wheel which I believe should work if you have the same setup but no promises (built for compute capability 3.5, 5.2, 6.0 and named tensorflow-gpu). Install with (not sure dropbox allows this direct linking):

sAbakumoff

• nylas/N1 💌 An extensible desktop mail app built on the modern web.
• black-screen/black-screen A terminal emulator for the 21st century.
• shockone/black-screen A terminal emulator for the 21st century.
• ptmt/react-native-macos React Native for macOS
• docker/kitematic Visual Docker Container Management on Mac & Windows
• kitematic/kitematic Visual Docker Container Management on Mac & Windows
• davezuko/wirk-starter Get started with React, Redux, and React-Router!
• TelescopeJS/Telescope 🔭 An open-source social news app built with Meteor & React
• coryhouse/react-slingshot React + Redux starter kit / boile

corbt

package com.your.app;

import android.app.Activity;
import android.os.Bundle;
import android.view.KeyEvent;

import com.facebook.react.LifecycleState;
import com.facebook.react.ReactInstanceManager;
import com.facebook.react.ReactRootView;
import com.facebook.react.modules.core.DefaultHardwareBackBtnHandler;

mikelehen

/**
 * Fancy ID generator that creates 20-character string identifiers with the following properties:
 *
 * 1. They're based on timestamp so that they sort *after* any existing ids.
 * 2. They contain 72-bits of random data after the timestamp so that IDs won't collide with other clients' IDs.
 * 3. They sort *lexicographically* (so the timestamp is converted to characters that will sort properly).
 * 4. They're monotonically increasing.  Even if you generate more than one in the same timestamp, the
 *    latter ones will sort after the former ones.  We do this by using the previous random bits
 *    but "incrementing" them by 1 (only in the case of a timestamp collision).
 */