Efficient communication and collection with compact normal forms
Efficient communication and collection with compact normal forms
复制标题
通过紧凑的范式进行高效的通信和收集
DOI：
--
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
Ryan Newton
中科院分区：
文献类型：
--
作者：
Edward Z. Yang;Giovanni Campagna;Ömer S. Agacan;Ahmed El;Abhishek Kulkarni;Ryan Newton
在分布式应用程序中，由于需要在发送之前将它们序列化为缓冲区，因此非连续数据结构的传输大大减慢了。我们描述了紧凑的正常形式，一种API，允许程序员可以将不可变的堆对象明确地放置在区域中，这些区域既可以像普通数据一样访问，并在网络上有效传输。将对象放置在紧凑区域（本质上是副本）的过程比任何序列化器都快，并且可以在有关数据结构的一系列功能更新中摊销。我们在格拉斯哥Haskell编译器中实现了此方案，并表明，即使使用带有内存为导向的数据结构表示的空间扩展者，我们在具有足够大的数据结构的快速本地网络上实现了X2和X4速度。
In distributed applications, the transmission of non-contiguous data structures is greatly slowed down by the need to serialize them into a buffer before sending. We describe Compact Normal Forms, an API that allows programmers to explicitly place immutable heap objects into regions, which can both be accessed like ordinary data as well as efficiently transmitted over the network. The process of placing objects into compact regions (essentially a copy) is faster than any serializer and can be amortized over a series of functional updates to the data structure in question. We implement this scheme in the Glasgow Haskell Compiler and show that even with the space expansion attendant with memory-oriented data structure representations, we achieve between x2 and x4 speedups on fast local networks with sufficiently large data structures.