asharp

8 ms·

1.
by asharp 13y ago
It's more of a capability thing. If you're running, say, Piston cloud you're using ceph over ethernet to back your disks, so you can easily decouple disk usage and ram usage. If you're stuck using local disks (ie. racks
2.
by asharp 13y ago
This makes sense when you keep in mind how the older clouds work (essentially VPS providers 101). You have a server with some disks, some ram and some cpus. You aggregate the disks together, then split them to form the individual disks for
3.
by asharp 13y ago
Also look at https://github.com/Seagate/Kinetic-Preview
4.
by asharp 13y ago
Key value stores are useful, and they are especially useful in this form factor. On the other hand, you now have a very large black box that you have to somehow navigate in order to create a workable system. Given that this is likely an a
5.
by asharp 13y ago
Bitrot? Error recovery? SMART data? ...?
6.
by asharp 13y ago
That doesn't seem to agree with http://www.fujitsu.com/downloads/MICRO/fma/pdf/LCD_Backgroun... .
7.
by asharp 13y ago
Using external kernels isn't in any way fundamental to the way Xen works. Most standard setups (even PV) have the kernel inside the VM, which allows for standard upgrades, etc.
8.
by asharp 14y ago
I think you should take a quick look at oracle's exadata machines. Mostly because they are both distributed and ACID compliant.
9.
by asharp 14y ago
Does this method have a name/are there any reasonable papers out there describing it?
10.
by asharp 14y ago
I saw that, but it doesn't seem to implement any of the indexes you'd need in order to run a bloom query efficiently. That being said, if you stored your bitvector as an array of powers of two, then it would work. But that would be horribly
11.
by asharp 14y ago
I believe that you can index the bloom column, to some extent, with some hacks. A major problem is a lack of indexes in array elements, which then forces you to build an otherwise unneeded table. That being said, it's definitely doable, to
12.
by asharp 14y ago
Cloud done right. Hardware that is approximately indistinguishable from tin sitting on your datacenter floor, pay by the second. To elaborate slightly. I mean hardware that you can run anything on, complete with full BMC, fast persistent di
13.
by asharp 14y ago
Cool speed hacks. An an improvement though, you only need two independent hash functions to run your bloom filter[1]. Strangely enough, this isn't well known and as such isn't implemented anywhere near as often as it should be (ie. it's not
14.
by asharp 14y ago
Mmmm. Strange. Anyways, the major problem is that shares and options are taxed like income at the time of issue, with no easy way to defer the tax bill. This makes it essentially untenable to hand out equity to employees. This then makes it
15.
by asharp 14y ago
It wouldn't surprise me if it has something like GCJ creating something like a .so that it loads on the fly. That is just a thought though, i haven't inspected it particularly closely.
16.
by asharp 14y ago
Would you mind elaborating? ssltrip requires a valid root ca, or an ssl library that doesn't check the signing chain. After using it though, the parameters are unencrypted and so can simply be sniffed. Are you attempting to reencrypt the pa
17.
by asharp 14y ago
Sure you can, assuming: 1) You know the hash function beforehand 2) You know that they are salting in exactly this way 3) You know how they are doing their salting (HMAC vs., vs.) 4) You have enough time to create this new rainbow table 5)
18.
by asharp 14y ago
Having a password salted with the username fairly easily balloons out the complexity of building and searching a rainbow table by a factor of the number of usernames you want to be useful for. This factor is larger then you'd expect, given
19.
by asharp 14y ago
DNS doesn't play particularly nice when you try and load balance it. You end up, essentially with issues with end users caching particular ip addresses and either failing when they shouldn't or causing load imbalances on particular servers
20.
by asharp 14y ago
You can in fact bond for 2gbps if you are on two different switches, in two completely different ways. One way involves the use of cisco stacking switches, allowing you to use 802.3ad between two independent 'stacked' switches. You can also
21.
by asharp 14y ago
From what i've read, the problem is that an attacker can add commits with forced Author information into a central repository to frame somebody else. Wouldn't the signing of all commits as they are committed solve this problem? (ie. rather
22.
by asharp 14y ago
From my understanding, I think they meant that mosh would deal with the more congested conditions better then ssh, thus providing a better experience. Just a hunch though. That being said, mosh is rather cool ^_^
23.
by asharp 14y ago
Be careful with that on rackspace. If I recall correctly, they use a credit scheduler with burst capacity. You need to be sure that you're not just getting a bunch of burst capacity and factoring that in with your cost calcs.
24.
by asharp 14y ago
Is that their dNAS product or something else?
25.
by asharp 14y ago
As I remember rackspace is a cloud in the same sense that Linode is a cloud, but not in the same sense that Amazon is a cloud, ie. they've taken an existing vps product (Slicehost) and resold it under the 'cloud' brand rather then developin
26.
by asharp 14y ago
Here's to hoping that its cloudfiles implementation no longer uses a file replicated sqlite db for indexing. (iirc it did earlier on. Scared me stupid when I found out).
27.
by asharp 14y ago
I'd say that the major reason is cost. Inside Australia you have the major peering fabrics which are on the order of a dollarish a mbit (cap). Compare that to $50-200/mbit for international transit and you'll see the problem. Quickly compar
28.
by asharp 15y ago
For the non network admins amongst us: http://lists.ausnog.net/pipermail/ausnog/2012-February/01222...
29.
by asharp 15y ago
Keep in mind that EC2 is simply one very specific case, and you can sum up a good portion of its problems with "It's designed to be cheap to build".
30.
by asharp 15y ago
You are correct in that you need performance parity for two items to be comparable. You are incorrect in saying that you take an order of magnitude performance hit when Virtualization, especially for CPU bound tasks [1]. In terms of disk yo

More ›