首页> 外文会议>International Symposium on Parallel and Distributed Computing >Sorting Algorithms Implemented Using JavaSpaces
【24h】

Sorting Algorithms Implemented Using JavaSpaces

机译:使用javaspaces实现的排序算法

获取原文

摘要

Java Spaces technology is a Java implementation of a tuple-based system providing a programming model that views an application as a collection of processes cooperating via the flow of objects into and out of one or more spaces. A space is a shared, network-accessible repository for objects together with their behavior. Processes perform simple operations to write objects into a space, take or read objects from a space that are of interest to them. This technology is suited for parallel computation applications and provides tremendous benefits in terms of scalability and fault-tolerance. I have described how three sorting algorithms can be implemented using Java Spaces technology.
机译:Java Spaces技术是基于元组的系统的Java实现,提供了一种编程模型,该编程模型将应用程序视为通过对象流入和从一个或多个空格中协作的过程的集合。空格是一个共享的网络可访问的存储库,用于对象以及其行为。进程执行简单的操作以将对象写入空间,从对其感兴趣的空间中拍摄或读取对象。该技术适用于并行计算应用,并在可扩展性和容错方面提供巨大的好处。我已经描述了如何使用Java Spaces技术实现三种排序算法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号