نتایج جستجو برای: data flow computing

تعداد نتایج: 3073999  

Journal: :Mobile Networks and Applications 2019

Journal: :CoRR 2013
Gaurav Sood K. Murali Krishnan

We consider the problem of Data Flow Analysis over monotone data flow frameworks with a finite lattice. The problem of computing the Maximum Fixed Point (MFP) solution is shown to be P-complete even when the lattice has just four elements. This shows that the problem is unlikely to be efficiently parallelizable. It is also shown that the problem of computing the Meet Over all Paths (MOP) soluti...

Cloud computing technology is providing businesses, be it micro, small, medium, and large scale enterprises with the same level playing grounds. Small and Medium enterprises (SMEs) that have adopted the cloud are taking their businesses to greater heights with the competitive edge that cloud computing offers. The limitations faced by (SMEs) in procuring and maintaining IT infrastructures has be...

2011
Chiara Bodei Viet Dung Dinh Gian Luigi Ferrari

The effective usages of computational resources are a primary concern of up-to-date distributed applications. In this paper, we present a methodology to reason about resource usages (acquisition, release, revision, ...), and therefore the proposed approach enables to predict bad usages of resources. Keeping in mind the interplay between local and global information occurring in the application-...

2011
Gian Luigi Ferrari

The management of the operations acting over distributed and virtual resources plays an important role for achieving the success of modern distributed applications. In this paper, we advocate a notion of resources as entities with their own local policies and containing their global interactive properties. We introduce a variant of π-calculus with primitives to declare, acquire and release reso...

2005
Zdzislaw Pawlak

This paper concerns the relationship between rough sets and flow graphs. It is shown that flow graph can be used both as formal language for computing approximations of sets in the sense of rough set theory, and as description tool for data structure. This description is employed next for finding patterns in data. To this end decision algorithm induced by the flow graph is defined and studied.

2007
Tristan Glatard Gergely Sipos Johan Montagnat Zoltan Farkas Peter Kacsuk

Many large-scale scientific applications require the processing of complete data sets made of individual data segments that can be manipulated independently following a single analysis procedure. Workflow managers have been designed for describing and controlling such complex application control flows. However, when considering very data-intensive applications, there is a large potential parall...

Journal: :International Journal of Innovative Science and Research Technology 2020

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید