Coloring of conflict graphs has been used in high level synthesis to map operators, values and data transfers onto Shared resources, however, finding a minimum sized coloring is NP hard problem.
高层次综合中通过对冲突围着色方式把操作、变量值、数据传输映射到共享资源中，然而寻找图着色所需的最小颜色数目是个NP难题。
To solve the problem of lacking dynamic organizing agility in distributed intrusion detection systems, an on-demand intrusion detection model adaptive to the Shared data environment was presented.
为了解决分布式入侵检测系统缺乏动态组织敏捷性的问题，提出了适应数据网格的按需入侵检测模型。
The main problem is the concept of shared-memory and the contention arising from accessing the same data protected by locks.
目前的主要难题是共享内存的概念和由访问加锁保护的同一数据所引起的争论。
应用推荐