低复杂度重构在分布式实时数据密集型Web服务架构中的应用

针对下一代分布式实时系统在重构时实时性要求较高的问题,提出了一种降低系统图复杂度并在有限时间内重构的方法。首先,利用服务组合确保重构在有限时间内实现;然后,通过路径选择算法和路径发送算法对图进行实时剪裁;最后,引入图构建算法消除具有更多非可调度路径的服务实现来降低图的复杂度。在i LAND服务重构和组合组件内部验证了该方法,实验结果表明,该方法能够显著减少解空间,大大减少了重构过程的计算时间,可以很好地满足数据密集型Web服务的实时性需求。

Listless zerotree image compression algorithm

In this paper,an improved zerotree structure and a new coding procedure are adopted,which improve the reconstructed image qualities. Moreover, the lists in SPIHT are replaced by flag maps, and lifting scheme is adopted to realize wavelet transform, which lowers the memory requirements and speeds up the ceding process. Experimental results show that the algorithm is more effective and efficient compared with SPIHT.