A concurrency control algorithm based on the transaction conflict graph is proposed.
提出了一种基于事务冲突图的并发控制方法。
The transmission scheduling of wireless mesh networks(WMNs) is modeled as a problem of conflict graph coloring.
无线网状网络是一种受到广泛关注的宽带无线网络架构。
Using this algorithm, we can know the chance for combining and how to exchange, and the use of precedences enables us to reduce the size of the conflict graph for global deadlock detections.
确定了结合的较佳时机以及如何进行转换；并提出了采用标定优先级的方法来缩减用于全局死锁检测的冲突图的规模。
The conflict between speed and hiding is solved, and at the same time the drawn quality of three dimensional area-graph is ensured.
在保证三维区域图绘制质量的同时，解决了速度和消隐的矛盾。
The conflict between speed and hiding is solved, and at the same time the drawn quality of three dimensional area-graph is ensured.
在保证三维区域图绘制质量的同时，解决了速度和消隐的矛盾。
应用推荐