Distributed Data Allocation Strategies

1988 ◽  
pp. 121-155 ◽  
Author(s):  
Alan R. Hevner ◽  
Aruna Rao
Keyword(s):  
Distributed Data ◽  
Data Allocation ◽  
Allocation Strategies

Security Test by using F T M and Data Allocation Strategies on Leakage Detection

2005 ◽  
Vol 4 (2) ◽  
pp. 393-400
Author(s):  
Pallavali Radha ◽  
G. Sireesha
Keyword(s):  
Third Party ◽  
Distributed Data ◽  
Data Allocation ◽  
Security Testing ◽  
Sensitive Data ◽  
Sample Data ◽  
The One ◽  
Security Test ◽  
Data Request ◽  
Allocation Strategies

The data distributors work is to give sensitive data to a set of presumably trusted third party agents.The data i.e., sent to these third parties are available on the unauthorized places like web and or some ones systems, due to data leakage. The distributor must know the way the data was leaked from one or more agents instead of as opposed to having been independently gathered by other means. Our new proposal on data allocation strategies will improve the probability of identifying leakages along with Security attacks typically result from unintended behaviors or invalid inputs.  Due to too many invalid inputs in the real world programs is labor intensive about security testing.The most desirable thing is to automate or partially automate security-testing process. In this paper we represented Predicate/ Transition nets approach for security tests automated generationby using formal threat models to detect the agents using allocation strategies without modifying the original data.The guilty agent is the one who leaks the distributed data. To detect guilty agents more effectively the idea is to distribute the data intelligently to agents based on sample data request and explicit data request. The fake object implementation algorithms will improve the distributor chance of detecting guilty agents.

DATA ALLOCATION STRATEGIES FOR PARALLEL IMAGE PROCESSING ALGORITHMS

1995 ◽  
Vol 09 (04) ◽  
pp. 615-634 ◽  
Author(s):  
VIRGINIE MARION-POTY ◽  
SERGE MIGUET
Keyword(s):  
Parallel Implementation ◽  
Image Data ◽  
Data Allocation ◽  
Load Imbalance ◽  
Parallel Image Processing ◽  
Parallel Image ◽  
Image Processing Algorithms ◽  
Processing Algorithms ◽  
Recursive Operators ◽  
Allocation Strategies

This paper discusses several data allocation strategies used for the parallel implementation of basic imaging operators. It shows that depending on the operator (sequential or parallel, with regular or irregular execution time), the image data must be partitioned in very different manners: The square sub-domains are best adapted for minimizing the communication volume, but rectangles can perform better when we take into account the time for constructing messages. Block allocations are well adapted for inherently parallel operators since they minimize interprocessor interactions, but in the case of recursive operators, they lead to nearly sequential executions. In this framework, we show the usefulness of block-cyclic allocations. Finally, we illustrate the fact that allocating the same amount of image data to each processor can lead to severe load imbalance in the case of some operators with data-dependant execution times.

scholarly journals Data Allocation Service ADAS for the Data Rebalancing of ATLAS

2019 ◽  
Vol 214 ◽  
pp. 06012
Author(s):  
Ralf Vamosi ◽  
Mario Lassnig ◽  
Erich Schikuta
Keyword(s):  
Scientific Workflow ◽  
Data Management System ◽  
Atlas Collaboration ◽  
Distributed Data ◽  
Data Allocation ◽  
Data Services ◽  
Learning Agent ◽  
And Storage ◽  
Proper Operation ◽  
Global Datasets

The distributed data management system Rucio manages all data of the ATLAS collaboration across the grid. Automation, such as data replication and data rebalancing are important to ensure proper operation and execution of the scientific workflow. In this proceedings, a new data allocation grid service based on machine learning is proposed. This learning agent takes subsets of the global datasets and proposes a better allocation based on the imposed cost metric, such as waiting time in the workflow. As a service, it can be modularized and can run independently of the existing rebalancing and replication mechanisms. Furthermore, it collects data from other services and learns better allocation while running in the background. Apart from the user selecting datasets, other data services may consult this meta-heuristic service for improved data placement. Network and storage utilization is also taken into account.

NBTI-Aware Data Allocation Strategies for Scratchpad Based Embedded Systems

2012 ◽  
Vol 28 (3) ◽  
pp. 349-363 ◽  
Author(s):  
Cesare Ferri ◽  
Dimitra Papagiannopoulou ◽  
R. Iris Bahar ◽  
Andrea Calimera
Keyword(s):  
Embedded Systems ◽  
Data Allocation ◽  
Allocation Strategies

scholarly journals LEAKING AGENT DETECTION AND EMAIL FILTERING

2013 ◽  
pp. 80-83
Author(s):  
GIRISH SHANKAR ◽  
SOMESHWAR DHAYALAN ◽  
ASHISH ANAND
Keyword(s):  
Data Allocation ◽  
Text File ◽  
Severe Damage ◽  
Sensitive Data ◽  
Confidential Data ◽  
Sample Data ◽  
Modern Business ◽  
Marking Technique ◽  
Data Request ◽  
Allocation Strategies

Leaking of confidential data to an unauthorized agent is a major concern for an organization. In this article we seek to detect the trusted node that leaks the confidential data to an unauthorized agent. Traditionally, leakage of data is handled by water marking technique which requires data modification. If the watermarked copy is found at some unauthorized site then distributor can claim his ownership. But one of the issues with watermarking method is data modification. To overcome the disadvantages of using watermark, data allocation strategies are used to improve the probability of identifying guilty third parties. The idea is to distribute the data intelligently to agents based on sample data request and explicit data request in order to improve the chance of detecting the guilty agents. Modern business activities also rely on extensive email exchange. Email leakages have become widespread, and the severe damage caused by such leakages constitutes a disturbing problem for organizations. Hence, filtering of E-mails is also necessary. This can be done by blocking E-mails which contains images, videos or sensitive data and filtering the text file of an organization.

Data allocation strategies for the Gauss and Jordan algorithms on a ring of processors

1989 ◽  
Vol 31 (1) ◽  
pp. 21-29 ◽  
Author(s):  
Yves Robert ◽  
Bernard Tourancheau ◽  
Gilles Villard
Keyword(s):  
Data Allocation ◽  
Allocation Strategies
Sign in / Sign up

Export Citation Format

Share Document