共查询到20条相似文献,搜索用时 15 毫秒
2.
4.
In a multicore transactional memory (TM) system, concurrent execution threads interact and interfere with each other through shared memory. The less interference a thread provokes the better for the system. However, as a programmer is primarily interested in optimizing her individual code’s performance rather than the system’s overall performance, she does not have a natural incentive to provoke as little interference as possible. Hence, a TM system must be designed compatible with good programming incentives (GPI), i.e., writing efficient code for the overall system should coincide with writing code that optimizes an individual thread’s performance. We show that with most contention managers (CM) proposed in the literature so far, TM systems are not GPI compatible. We provide a generic framework for CMs that base their decisions on priorities and explain how to modify Timestamp-like CMs so as to feature GPI compatibility. In general, however, priority-based conflict resolution policies are prone to be exploited by selfish programmers. In contrast, a simple non-priority-based manager that resolves conflicts at random is GPI compatible. 相似文献
7.
8.
9.
10.
11.
12.
14.
16.
Variable-radius circles are common constructs in planar constraint solving. We give a complete treatment of variable-radius circles when such circles must be determined simultaneously with placing two groups of geometric entities. Part I sets up the problem statement and considers clusters where the relative motion is translational. It also reviews past work on the subject. Part II treats rotational clusters motion. 相似文献
17.
18.
Part I of this series of three papers handles the identification of single input single output Box-Jenkins models on arbitrary frequency grids in an open and closed loop setting. Part II discusses the computational aspects and illustrates the theory on simulations and a real life problem. This paper extends the results of Parts I and II to multiple input multiple output systems. Contrary to the classical time domain approach, the presented technique does not require symbolic calculus for multiple output polynomial Box-Jenkins models. 相似文献
19.