哪怕是程序间通信最快捷的双向通信机制,因为从一个申请到另一个计算机应用的校对需要与多个校对通信,而通信线可以是不同的有形的CPU。
我认为,这将涉及共享记忆和循环缓冲机制以及共同的同步机制。
但是,当校对不同有形的CPU进行校对时,共有的体力非常昂贵(而且数量有限)。
你也许希望首先研究现有的图书馆,例如MPI和开放管理计划。 他们往往得到较好的调整。
如果你愿意接受更尖端的做法,那么你可以尝试Barrelfish正在做些什么,见。 。
如果你将使用C++,电能有一个可携带的极低的IPC图书馆。 这使你能够协调并分享进程之间的记忆。
If I have an algorithm which is comprised of (let s say) three sub-algorithms, all with different O() characteristics, e.g.: algorithm A: O(n) algorithm B: O(log(n)) algorithm C: O(n log(n)) How do ...
I m using Electro in Lua for some 3D simulations, and I m running in to something of a mathematical/algorithmic/physics snag. I m trying to figure out how I would find the "spin" of a sphere of a ...
There s a (relatively) new sort on the block called Timsort. It s been used as Python s list.sort, and is now going to be the new Array.sort in Java 7. There s some documentation and a tiny Wikipedia ...
As a learning experience I recently tried implementing Quicksort with 3 way partitioning in C#. Apart from needing to add an extra range check on the left/right variables before the recursive call, ...
Given a 10 digit Telephone Number, we have to print all possible strings created from that. The mapping of the numbers is the one as exactly on a phone s keypad. i.e. for 1,0-> No Letter for 2->...
I have a directed graph and my problem is to enumerate all the minimal (cycles that cannot be constructed as the union of other cycles) directed cycles of this graph. This is different from what the ...
Given an array of integers arr = [5, 6, 1]. When we construct a BST with this input in the same order, we will have "5" as root, "6" as the right child and "1" as left child. Now if our input is ...
I was trying to speed up a certain routine in an application, and my profiler, AQTime, identified one method in particular as a bottleneck. The method has been with us for years, and is part of a "...
