Skip to main content

A SCALABLE FRAMEWORK FOR WIRELESS DISTRIBUTED COMPUTING

A SCALABLE FRAMEWORK FOR WIRELESS DISTRIBUTED COMPUTING

ABSTRACT
A wireless distributed computing system, in which multiple mobile
users, connected wirelessly through an access point, collaborate to perform a computation task. When users communicate with each other via the access point to exchange their locally computed intermediate computation results, which is known as data shuffling. We propose a scalable framework for this system, in which the required communication bandwidth for data shuffling does not increase with the number of users in the network idea is to utilize a particular repetitive pattern of placing the data set (thus a particular repetitive pattern of intermediate computations). In order to provide the coding opportunities at both the users and the access point

CONTINUE
 We also demonstrate that the proposed data set placement and coded
 shuffling schemes are optimal (i.e., achieve the minimum required
shuffling load) for both a centralized setting and a decentralized
 setting, by developing tight information-theoretic lower bounds.





EXISTING SYSTEM

     A wireless distributed computing system, in which multiple mobile
users, connected wirelessly through an access point, collaborate to perform a computation task.

DISADVANTAGES
 Multiple users takes place
 Data shuffling is done

PROPOSED SYSTEM
Scalable wireless distributed computing framework, for both the centralized and the decentralized settings, such that the shuffling load does not increase with the number of participating users. In particular, we use are repetitive placement of the dataset across the users to enable coding, reducing the shuffling load by a factor that scales linearly with the network size.

ADVANTAGES
 Shuffling does not increase the number of participating users
 repetitive placement of the dataset across the users to
enable coding reducing the shuffling
 achieve the minimum required shuffling load
 improving the response
 latency, increasing their computing capabilities, and enabling
 complex applications in machine learning, data analytics, and
autonomous operation

SYSTEM REQUIREMENTS
HARDWARE REQUIREMENTS
 System : Pentium IV 2.4 GHz.
 Hard Disk : 40 GB.
 Floppy Drive : 1.44 Mb.
 Monitor : 15 VGA Colour.
 Mouse : Logitech.
 Ram : 512 Mb.
SOFTWARE REQUIREMENTS
 Operating system : Windows XP/7.
 Coding Language : ASP.net, C#.net
 Tool : Visual Studio 2010
 Database : SQL SERVER 2008

CONCLUSION


In this paper, we proposed a scalable wireless distributed computing framework, for both the centralized and the decentralized settings, such that the shuffling load does not increase with the number of participating users. In particular, we use a repetitive placement of the dataset across the users to enable coding, reducing the shuffling load by a factor that scales linearly with the network size.

Comments

Post a Comment

Popular posts from this blog

Inverted Linear Quadtree: Efficient Top K Spatial Keyword Search

Inverted Linear Quadtree: Efficient Top K Spatial Keyword Search ABSTRACT: In this paper, With advances in geo-positioning technologies and geo-location services, there are a rapidly growing amount of spatiotextual objects collected in many applications such as location based services and social networks, in which an object is described by its spatial location and a set of keywords (terms). Consequently, the study of spatial keyword search which explores both location and textual description of the objects has attracted great attention from the commercial organizations and research communities. In the paper, we study two fundamental problems in the spatial keyword queries: top k spatial keyword search (TOPK-SK), and batch top k spatial keyword search (BTOPK-SK). Given a set of spatio-textual objects, a query location and a set of query keywords, the TOPK-SK retrieves the closest k objects each of which contains all keywords in the query. BTOPK-SK is the batch processing of sets...
Post a Comment
Read more

A simple and reliable touch sensitive security system CODING

#include <REGX51.H> #include "lcd.c" #define MAX_DELAY() delay(65000) sbit Vibra_Sense=P3^1; sbit Buz=P1^0; void intro() {  lcd_init();  lcd_str("Touch Sensitive ",0x80);  lcd_str("Security System ",0xc0);  MAX_DELAY();MAX_DELAY();  lcd_clr();  }  void main()  { unsigned int i = 0, j= 0; intro();    while(1)    { lcd_str("Security Syst On",0x80); lcd_str("No Vibra Detectd",0xc0); Buz = 1; if(Vibra_Sense == 1) { while(Vibra_Sense == 1) delay(1000); } else { while(Vibra_Sense == 0) delay(1000); } Buz = 0; lcd_str("Vibraton Detectd",0xc0);delay(65000); while(1);    }  }
Post a Comment
Read more

A Time Efficient Approach for Detecting Errors in Big Sensor Data on Cloud

A Time Efficient Approach for Detecting Errors in Big Sensor Data on Cloud Abstract                                                                                                                                                      ...
Post a Comment
Read more