Large graphs analytics has been an important aspect of many big data applications, such as web search, social networks and recommendation systems. Many research focuses on processing large scale graphs using distribut...
详细信息
Smart devices, mobile robots, ubiquitous sensors, and other connected devices in the Internet of Things (IoT) increasingly require real-time computations beyond their hardware limits to process the events they capture...
详细信息
ISBN:
(纸本)9781509036837
Smart devices, mobile robots, ubiquitous sensors, and other connected devices in the Internet of Things (IoT) increasingly require real-time computations beyond their hardware limits to process the events they capture. Leveraging cloud infrastructures for these computational demands is a pattern adopted in the IoT community as one solution, which has led to a class of Dynamic Data Driven applications (DDDA). These applications offload computations to the cloud through distributed Stream processing Frameworks (DSPF) such as Apache Storm. While DSPFs are efficient in computations, current implementations barely meet the strict low latency requirements of large scale DDDAs due to inefficient inter-process communication. This research implements efficient highly scalable communication algorithms and presents a comprehensive study of performance, taking into account the nature of these applications and characteristics of the cloud runtime environments. It further reduces communication costs within a node using an efficient shared memory approach. These algorithms are applicable in general to existing DSPFs and the results show significant improvements in latency over the default implementation in Apache Storm.
In this paper,we are presenting QR factorization algorithms that can tolerate process crashes and soft errors(bit flips).Our algorithms take advantage of structural properties of a QR factorization algorithm referred ...
详细信息
ISBN:
(纸本)9781509035946
In this paper,we are presenting QR factorization algorithms that can tolerate process crashes and soft errors(bit flips).Our algorithms take advantage of structural properties of a QR factorization algorithm referred to as "communication-avoiding".We show that,exploiting these properties,our resilient,robust algorithms modify the communication pattern of the computation but do not add any significant computation in the critical path.
parallelising sequential applications is usually a very hard job, due to many different ways in which an application can be parallelised and a large number of programming models (each with its own advantages and disad...
详细信息
暂无评论