You are on page 1of 3

Tea m No.

Members
1

Topic Preference 1

Review Topic Preference 1

Topic Preference 2

Review Topic Preference 2

Topic Preference 3 Review Topic Preference 3
(1). The paper is just paralelling an application just like paralleling matrix multiplication which is done to show the comparitive result of parallel and serial. (2). the first 2 papers are related so the work can be combined together but the 3rd paper is not very relevant.

Amit Rajawat Eshan Updation of Replicated files in a distributed Goyal Vivek Harilal Computing System 2 Giridhar Rai Jyoti Prakash Parmil Kumar

(1) Paper is bit older, try to choose the latest work on the selected topic.

Bidirectional election algorithm for ring topology

(1). Good Paper for implementation. (1) Good Paper but needs more better understanding and better write up. (2) Try to search some more related papers

A Parallel Floyd-Warshall algorithm based on TBB

Map Reduce:Simplified Data processing on large clusters

(1) Paper is bit older, work is already been executed many times. (1) Paper is Good but you need better understanding about the paper. (2) DO PROPER LITERATURE SURVEY ON THE TOPIC (3) Try to serach some more related papers on the same topic

Spanner:Google's globally Distributed Database

Large Scale incremental processing using distributed (1) Good Paper but needs more better understanding and transactions and notification better write up. (2) Try to search some more related papers Distributed Bayesian Network Structure Learning NOT AVAILABLE (1) Not good Pref 1 is better then A Distributed this since both speak Synchronized Clocking of clock Method synchronization Adaptive Clustering for Mobile Wireless Networks (1) Very old paper Distributed Computer Vision Algorithms Through Distributed Averaging

3

DATA MINING USING HIERARCHICAL Vivek Kumar Apratim VIRTUAL K-MEANS APPROACH Bhattacharya Akash INTEGRATING DATA FRAGMENTS IN Lal Das CLOUD COMPUTING ENVIRONMENT

Optimizing File Availability in a Secure Serverless Distributed File System

NOT AVAILABLE (1) Very Old Paper (2) Try to read latest work (3) The proposed work is all about load balancing in WSN try to get the same thing using updated latest work (1) Good Paper (2) Needs Better understanding please do more survey

Mining Twitter using Cloud Computing

(1) Good (2) Try to search more relevant work on it

4

A Distributed Synchronized Clocking Method Ali Abbas Sarthak and Improving Fault Tolerance in High Soni Jinesh Jain Precision Clock Synchronization Arun Joshi Sheethal Kumar Darshan P Dynamic Load Distribution Algorithm performance in heterogeneous distributed systems

(1) Good Paper (2) Need to formulate the algorithm for the proposed work (1) Good Paper try to analyze same related work and come up with better explanation

Load Balancing in Wireless Network Task Scheduling Algorithm for Heterogenous Distributed Computing Systems Stratus: A distributed computing framework for scientific simulations on the cloud

Achieving Strong Consistency in a Distributed File System NOT AVAILABLE Distributed Workflow Management Systems A Fuzzy Dynamic Load Balancing Algorithm for Homogenous Distributed Systems independent task scheduling based on genetic algorithm in cloud computing Flash: An Efficient and Portable Web Server." Job Scheduling in a distributed system using backfiling

5

NOT AVAILABLE

6

Path-based Heuristic Task Scheduling Prathibha M.V Dhivya Algorithm for Heterogeneous Distributed A Computing Systems

(1) Average

(1) Good Paper (2) Needs Better understanding, do more survey

(1) Good Paper (2) Do more survey

7

Pooja Vadiraja Prajwala Chandramouli Swarup

a task allocation algorithm for distributed computing systems VS "A Distributed Object Model for the Java System.". Botnet Detection using distributed computing framework Fair Scheduling for Distributed Computing Clusters

(1) Very Old Paper (2) Try to read latest work NO ABSTRACT AVAILABLE (1) Good Paper try to analyze same related work and come up with better explanation (1) Good paper but needs better writing and understanding

an efficient file transmission algorithm for distributed computing MapReduce: Simplified Data Processing on Large Clusters Cryptography based authentication for cloud computing Distributed Computation in Dynamic Networks

(1) Very Old Paper (2) Try to read latest work

(1) Good Paper (2) Do more survey

8

9

10

Sriniketh V Muthukumar Suresh Sajin Sasy Mora Sreyantha Chary Prashanth Kumar Jain Zachariah Srivaths Sai Prashanth Syed Rahi S V Shanmuga Sunder Y. Vishwachaitanya Glaston Menezes Akshay Rai Brijesh S. K. Santosh Kumar A

(1) Good Paper

(1) Good Paper (2) Do more survey Intelligent Task Scheduling for Computational Grid Dynamic task scheduling using genetic algorithms for heterogeneous distributed computing

(1) Can look for better work

Secure Grid Computing

NOT AVAILABLE

(1) Good Paper

11

Exploiting Redundancies to Enhance Schedulability in Fault-Tolerant and Real-Time Distributed Systems (1) Good paper try to do more survey

Heuristic algorithms for optimization of task allocation and result distribution in peer–to–peer computing systems (1) Good paper try to do more survey

12

Leader election algorithm in a DCS Distributed Route Selection for Establishing Real-Time Channels

(1) Very Old Paper (2) Try to read latest work (1) Good Paper but you can search for latest work in the same problem

13

14

Chetan Dugar Tejas N Rao Sumit Bansal

A Genetic Algorithm For Process Scheduling In Distributed Operating Systems Considering Load Balancing (1) Good Paper

15 Abhishek Todmal Karan Tauk 16 A GPU Implementation of Generalized Graph Processing Algorithm GIM-V Not clear what you are trying to implement Optimal Deadlock Detection in Distributed Systems Based on Locally Constructed Waitfor Graphs (1) Very Old Paper (2) Try to read latest work

Ankush Mehta Rahul Kumar

17

Archita Chopde Sonal Locating object in a distributed computing Patil Priya Rao system using ant colony optimization Priyanka Koppula Performance Comparison Study Of Routing Uma Bera Lavanya B Protocol for Mobilr Grid Environment.

(1) Good Paper try to analyse better latest paper and give detailed explanation

Processing a Trillion Cells per Mouse Click NOT AVAILABLE Efficient Task Migration Algorithm for Distributed Clock synchronization in LAN (1) Average Systems (1) Very Old Paper (2) Try to read latest work Adaptive load sharing in Request Redirection Algorithms for homogeneous distributed Distributed Web Systems systems System Anomaly Detection (1) Good Paper (2) try to give better write in Distributed Systems Performance Analysis in Distributed up on the methodology, how to implement through MapReduce-Based System of Dynamic Load Balancing Using Fuzzy Logic (proposed algorithm) Log Analysis (1) Good Paper method of GlobUpdate () and GlobMax () in our The optimization paper makes its time complexity reduce to T (n /1024) on CPU. When m increases, how to design a better optimization method on Simultaneous Multi-Level Divisible GPU to reduce the time complexity further is our ongoing work, Load Balancing for Heterogeneous You propose to decrease this overhead. Performance Optimization of and we believe this problem alone is also important because it can Desktop Systems HOW??? Top-k Queries on GPU be applied to other problems. IS IT SIMPLY CUT & PASTE??? Bandwidth-aware divisible task scheduling for cloud computing:Bandwidth is one of the good Scalability of Web-Based A Distributed Decision Support System metric to be considered for any optimisation, Electronic Commerce for Building Evacuation can be implemented. Systems (1) GooD (2) Try to get more related latest Papers Efficient genetic algorithm Load balancing for distributed and for task scheduling in (1) Good Paper try to analyse better latest paper and give integrated power systems using grid (1) Good Paper try to analyse better latest heterogenous computing computing paper and give detailed explanation systems detailed explanation SAFER (Secure and Fast Encryption Routine)

(1) Good Paper

18

(1) It is a Survey paper (2) Try Studying some better paper NetworkSimulator NS2

Comes under Network field

Comes under Network field A decentralized deadlock detection and resolution algorithm for generalized model in distributed systems (1) Good Paper

19 Tavan Reddy Vijay S Nishaanth Reddy The Weighted Byzantine Agreement Problem (1) Good Paper (1) What security you can provide using: log for tracking all users’ activities. (2) you need to have better understanding and better write up (3) search for still better paper on the same field Bandwidth-aware divisible task scheduling for cloud computing adaptive distributed system (An Algorithm for Dynamic Load Balancing in Distributed Systems with Multiple Supporting Nodes by Exploiting the Interrupt Service )

20

Sukhwant Prafullit Pratik manwatkar Ankit kumar Agarwal

cloud security (A Security Model for Distributed Computing)

(1) Good Paper (1) Good Paper (2) Give better write up in: Your findings of the drawbacks in the research/ Suggestions for improvements (3) give detail understanding of the paper (4) give the algorithm in formal way about wwhat you large scale distributed are planning to propose and how system crowd simulation

Lattice Completion Algorithms for Distributed Computations

NOT AVAILABLE

(1) Good Paper (2) try to get more related and show how the result is viewed using crowd simulation

19

The Weighted Byzantine Agreement Problem: try to find any real world example for applying solution of this Tavan Reddy Vijay S Nishaanth Reddy The Weighted Byzantine Agreement Problem problem.

Bandwidth-aware divisible task scheduling for cloud computing

Bandwidth-aware divisible task scheduling for cloud computing:Bandwidth is one of the Lattice Completion good metric to be considered for any Algorithms for Distributed optimisation, can be implemented. Computations

Lattice Completion Algorithms for Distributed Computations: cant find the pdf of the same topic in zip file. Topic names are not matching.

. but not best. Rationality and Self interest in Peer-to. Quincy: Fair Scheduling for Distributed Computing Clusters: good concept but can be implemented using the some of available efficient scheduling algorithm than fair scheduling.(and also make sure wether it is a cloud or distributed. Flexible. A Genetic Algorithm for Process Scheduling in Distributed Operating systems considering Load Balancing: the proposed metho to the problem is not clear and A Genetic Algorithm for Process involves many variables in agorithm. Parallel Breadth-First Search on Distributed Memory Parallel breadth-first search System:Involves good application of some of wel known on Distributed Memory datastructures at distributed level to attain consistancy and speed Systems of operation. a large-scale Distributed Systems Tracing Dapper. Fault tolerant clustering of wireless sensor networks: not a distiributed concept A Protocol Design of Communication State Transfer for Distributed Computing: good one compared to previous 2 concepts. A New Collaborative Trust Enhanced Security Model for Distributed System A New Collaborative Trust Enhanced Security Model for Distributed System: some enhanced version of this trust security model is availabe consider them also.20 Sukhwant Prafullit Pratik manwatkar Ankit kumar Agarwal cloud security (A Security Model for Distributed Computing) 21 Anusha Rani Dara Vainika Dhanya Mary Jacob A Clock-Sampling Mutual Network TimeSynchronisation Algorithm for Wireless Ad Hoc Networks cloud security: this is very vast area. SYSTEMS CONSIDERING LOAD BALANCING Distributed Computation in Dynamic Networks: real work actually involves in simulation of dynamic network . the real time data collection. cant able to comeup with efficient cost at any given time instant. Distributed Mutual Exclusion Algorithm 26 Mohit Nebhnani Ravi Ranjan Jitendra Singh A Composition Approach to Mutual Exclusion Algorithms for Grid A Composition Approach to Mutual Exclusion Applications: good concept but discipllined Algorithms for Grid Applications implementation is required. The analysis of the results after making enhancements to the basic Kmeans does not show any satisfactory results unless it is given with the large data piece. Distributed Systems with WheelFS adaptive distributed system (An Algorithm for Dynamic Load Balancing in Distributed Systems with Multiple Supporting Nodes by Exploiting the Interrupt Service ) An Algorithm for Dynamic Load Balancing in Distributed Systems with Multiple Supporting Nodes by Exploiting the Interrupt Service: good concept but all the concepts in the base large scale distributed paper are cannot be implemented system crowd simulation large scale distributed system crowd simulation: comparitively better than rest of the concepts submitteed. Basically good concept to implement. Flexible. take consideration of latency while implemetation. Cluster Based Multiple Task Allocation:many recent enhances to the proposed methods do exist consider them as Cluster Based Multiple Task Allocation wel. try to identify the perticular area to which you want to give the security to. Should not lead to starvation Using Backfilling with Inaccurate Runtime Computations or dead lock .?) A Clock-Sampling Mutual Network TimeSynchronisation Algorithm for Wireless Ad Hoc Networks: many advanced algorithms available as similar to this try those. wireless sensor networks Parallel Breadth-First Search on Distributed Memory Systems: the context or the data with respect to the search is applied is not clear.learning. 23 Scheduling Mixed Real-time and Non-realtime Applications In Map-Reduce Environment Sowmya Sridhar Varsha G Maragi Scheduling Mixed Real-time and Non-realtime Applications In Map-Reduce Environment:the care has to be taken A Distributed Decision Support System while deciding the length of each task or K-Means Clustering with for Building Evacuation process and priorities. while not a silver bullet to address all network implementation problems is a good tool to use when designing robust systems" is not clear somewhat. and discovery" this huristics method Peer networks is missing in the paper. Dynamic Load Balancing A Dynamic Sliding Load Balancing Distributed system for Strategy in Distributed Systems : try to find access control to physical any new availabe methods for same problem. 4 Rationality and Self Interest in Peer to Peer networks: context with respect to the following phrase "Mechanism design. 22 Arka Rai Choudhuri Shriyak Sridhar Kalyanasundaram S Cooperation in Wireless Ad Hoc networks: The concept is good. but whatever the mathematical calculations and algorithm is given in the paper are somewhat complex to implement in real Cooperation in Wireless Ad Hoc networks time using availavble resource. 27 Rohtash Rahul Ravindra Avinash Das Determining the global state of Distributed systems Analysis of Replication and Replication Algorithms in Distributed System: if any further enhancements are done with analysis it will find some more weitage. Analysis of Search and Replication in Unstructured Peer-to-Peer Networks Fast and Message-Efficient Global Snapshot Algorithms Fast and Message-Efficient Global Snapshot Algorithms for for Large-Scale Distributed Large-Scale Distributed Systems: comparitively good one Systems among rest of 2. that consider the past expirience as wel. Hence this paper involves the analysis not a working model can not be considered for major project. A minimum-process coordinated checkpointing protocol for mobile distributed systems: mobility of the systmes is major concern of implementation. So need to take repeated trails to minimise the cost. Intelligent Task Scheduling for Computational Grid : concept proposed is not limited to perticular area. Dapper. existing protocol stacks cant be considered as Fault tolerant clustering of Reno and SACK TCP project. Heuristic Algorithms for task assignment in Distributed Systems Heuristic Algorithms for Task Assignment in Distributed Systems: relatively good concept compared to rest of the two concept. Distributed Computing Systems Using Distributed Systems Genetic Algorithms Simulation based comparisons of Tahoe. computaion is difficult but the concept is good. Bagging and MapReduce efficient detection and resolution of generalized distributed deadlocks: all the earliear algorithms must be onsidered while coding proposed algorithms 4. a large-scale Distributed Systems Tracing Infrastructure: the infrastructure or configuraiton Is lil hard to find Infrastructure inorder to run Dapper. though they are distributed across the geographical area. historic observations as mentioned in the abstract and historic data is somewhat difficult to collect with respect to different application contexts Task allocation for minimizing cost of distributed computing systems using genetic algorithms : this involves huristic approach. resources based on qualifications Using Data Accessibility for Resource Selection in LargeScale Distributed Systems: The technique used in this paper relies only on local. Reno and SACK TCP: does nt find any distributed system concepts.huristics also involves "experiencebased techniques for problem solving. A Distributed Decision Support System for Building Evacuation: the paper involves the concepts like wireless sensor networks and sensor nodes the gathering of data at real time and evolution of the system is somewhat complex to implement. Wide Area Storage for and this is little old concept. Job Scheduling in a Distributed System Using Backfilling with Inaccurate Runtime Computations: should concentrate on all Job Scheduling in a Distributed System the types of the jobs(irrespective of time it consume). Wide Area Storage for Distributed Systems with WheelFS: good concept but. 30 Richa Shastri Sahana V P Shweta Mandloi 31 Abhishek Uppar Madhusudan D Nagaraja S 32 Karthik Kumar Rajiv Veera Rakesh kashyap An Algorithm for Dynamic Load Balancing in Distributed Systems with Multiple Supporting Nodes by Exploiting the Interrupt Service: good concept but all the concepts in the base paper are cannot be implemented Using Data Accessibility for Resource Parallel Breadth-First Search on Selection in Large Distributed Systems Distributed Memory Systems Crypto System based Authentication using CSTA in Grid:creation of the grid confinig standerds to csta is major Task Allocation for Minimizing Cost of A Dynamic Sliding Load Balancing Strategy in challenge. efficient detection and resolution of generalized distributed deadlocks Analysis of Search and Replication in Unstructured Peer-to-Peer Networks:main focus must be given to the replication strateegies of the search objects. 28 Naveen KS Pavan KY M Thejaswi An algorithm for k-mutual exclusion in decentralized systems 29 Jayashree Pragathi N Swetha N SYSTEMS CONSIDERING LOAD BALANCING An algorithm for k-mutual exclusion in decentralized systems: good concept bt care must be taken while implementing the deadlock and starvation algorithms. K-Means Clustering with Bagging and MapReduce: this concept involves the enhancement to existing clustring algorithm K means.. the core part lies in the implementaion of the what ever algorithms given in the paper using available resources. 24 Chaitanya Kulkarni Prakhar Ojha Akash Bharadwaj Anuj Jain Ishank Jain Rajat Goyal A minimum-process coordinated checkpointing protocol for mobile distributed systems Comparison-Based System-Level Fault Diagnosis in Hoc Networks :too old concept 2 Ad- 25 Time Stamp Based Algorithm For Task Scheduling In A DCS Time Stamp Based Algorithm For Task Scheduling In A DCS: good one. Simulation of Simulation based comparisons of Tahoe. synchronization. those Scheduling in Distributed Operating have to be initialised before algorithm starts systems considering Load Balancing any processing.

And the terms fuzzy. Modified bully algorithm for electing coordinator in distributed systems The hadoop distributed file system: Architecture and design An Algorithm for Dynamic Load Balancing in Distributed Systems with Multiple Supporting Nodes by Exploiting the Interrupt Service: A Distributed Primary Segmented good concept but all the concepts in the Backup Scheme For Dependable Realbase paper are cannot be implemented Time Communication In Multihop Network Modified bully algorithm for electing coordinator in distributed systems: some new recent approachs are available to this Learning for Distributed Artificial problem come up with new solution. Review comments without GREEN color means that none of the proposed topics is approved. But little complex to attain that logrithmic complexity in real time.33 Rahul Tarway Rabart Kurrey Aadesh Gupta 34 Abhishek Agrawal Akash Kumar Nikhil Jain An Algorithm for Dynamic Load Balancing in Distributed Systems with Multiple Supporting Nodes by Exploiting the Interrupt Service. The concept is Regional Consecutive leader election in somewhat deviating form distributed Mobile adhoc Networks computing. Wtudent need to find new topics and submit before 10/2/13.1 Scheduling Algorithms for Grid Computing:hence it is a Open Problem try to find out with your own implementaion. File Storing in Distributed Computing System: concept is too old. mobile runtime are somewhtat deviating from connected components the actual distributed concepts. 35 Rizwan Alam Scheduling Algorithms for Grid Computing: Efficiently querying archived data using Hadoop development of distributed fuzzy systems: the main concept of distributed systems is missing.An experimental survey A Distributed Primary Segmented Backup Scheme For Dependable Real-Time Communication In Multihop Network: many modern implementations would exist try to find recent one.. check for any other related recent work Regional Consecutive Network NOTE Review comment in GREEN color means that the corresponding topic is approved. Intelligence Systems Cloud computing using Hadoop. try recent File Storing in Distributed Computing System approach to these kind of problems. 36 Narendran Elango Vinu K S Yogesh Agarwal Jatin Chauhan Manish Vidyasagar 37 Regional Consecutive leader election in Mobile adhoc Networks: this is purely wireless based concept. development of distributed fuzzy systems Finding Connected Components in Map-Reduce in Logarithmic Rounds: relatively good concept compared to previous two. . Performance comparision of load balancing algorithm Performance comparision of load balancing algorithm through code migration in through code migration in distributed Desktop computing distributed Desktop computing grid grid: good concept compared to rest of two. 38 Rajesh Prasad Rohit Kumar A Election Algorithm in a Distributed System Good old problem Task Allocation for DCS A GENETIC ALGORITHM FOR PROCESS SCHEDULING IN DISTRIBUTED OPERATING SYSTEMS CONSIDERING LOAD BALANCING 2007 paper. using mapreduce Task Allocation for DCS: concept is too old. try recent approach to these kind of problems.