SDxCentral Weekly News Roundup — August 5, 2016
Big Switch Networks announced the company’s launch in Australia.
Big Switch Networks announced the company’s launch in Australia.
On Wednesday members of the Docker SF Meetup community joined us at Docker HQ for our 47th Docker meetup in San Francisco! It was a great evening with talks and demos from Docker’s own Ben Bonnefoy, Nishant Totla, as well as Neil Gehani from HPE.
This is a guest post by Stephen Pope & Kevin Kaland from Project Ricochet
Docker Cloud is a SaaS solution hosted by Docker that gives teams the ability to easily manage, deploy, and scale their Dockerized applications.
Continue reading
The post Worth Reading: Top performance items to watch appeared first on 'net work.
Bad things sometimes happen to good companies, but the great ones are resilient; they ride out the difficulties and keep forging ahead. So it will be with Cray, which does not just make massive-scale machines aimed at supercomputing centers but analytics engines that will see wider adoption among enterprises.
We have said it before and we will say it again: You have to take a long view of the high performance computing business – and we are using that term in the broadest sense – and not look at it on a quarter-by-quarter or even year-by-year basis. And so it …
Taking A Long View On HPC And Beyond was written by Timothy Prickett Morgan at The Next Platform.
Apollo Global is reportedly negotiated a $3.5B price for the firm.

Which is faster, Python or Go? And by how much? This is the question I found myself asking earlier this week after troubleshooting a script that my son had written in Python to calculate prime numbers.
My son worked out a fairly simple algorithm to generate prime numbers which we tweaked slightly to optimize it (things like not bothering to check even numbers, not checking divisors that are larger than 1/3 of the number, not checking any number ending in 5, and so on). I’m not saying that this is production-ready code, nor highly optimized, but it does appear to work, which is what matters. The resulting code looks like this:
#!/usr/bin/python
max = 100000
for tens in xrange(0,max,10):
for ones in (1, 3, 7, 9):
a = tens + ones
halfmax = int(a/3) + 1
prime = True
for divider in xrange (3, halfmax, 2):
if a % divider == 0:
# Note that it's not a prime
# and break out of the testing loop
prime = False
break
# Check if prime is true
if prime == True:
print(a)
# Fiddle to print 2 as prime
if a == 1:
Continue reading
Its Weekly Show 300! Time for an update about how show is doing, our public appearances, and then some tech news on Greg s trip to IETF 96 in Berlin. The post Show 300: The IETF Is The Best We’ve Got & A Packet Pushers Update appeared first on Packet Pushers.
Hey, it's HighScalability time: