M Tech Dissertations
Permanent URI for this collectionhttp://drsr.daiict.ac.in/handle/123456789/3
Browse
6 results
Search Results
Item Open Access Empirical Study Of Smartphones As An Edge Device(Dhirubhai Ambani Institute of Information and Communication Technology, 2023) Shah, Vyom Hiteshkumar; Sasidhar, KalyanIncreased automation and intelligence in computer systems have revealed Cloudbasedcomputing constraints such as unpredictable latency in safety-critical andperformance-sensitive applications. Features of smartphones attract researchersmore towards using smartphones as edge computing devices because of the presenceof the sensors inbuilt and the computing powers of CPU cores. So a smartphoneis a combination of IoT and Edge computing devices.To overcome the usage of high-end computing devices at the edge layer, thisarticle proposes the idea of using a smartphone as an edge device for processingdata. Sensors or IoT devices generally send data to the edge device ratherthan directly sending it to the cloud for processing. So mainly, this article emphasizessolving the research question of whether smartphones can be used as edgedevices. So in this, a distributed smartphone system following master-slave architectureis proposed, which helps to distribute the computation power amongslaves. Word count, average of temperature data and indoor localization. Comparedto desktop PCs computation, master-slave utilizes CPU 75% more than juston single-device computation and on an average 50% faster than on computingon a single device. This motivates us to design an architecture that can utilizethe data from the cloud and perform the computation using the CPU cores of thesmartphone.Item Open Access Policy based resource allocation on infrastructure as a service cloud(Dhirubhai Ambani Institute of Information and Communication Technology, 2011) Vora, Dhairya; Chaudhary, Sanjay; Bise, MinalCloud computing refers to the provision of computational resources on demand. Resource allocation is an important aspect in cloud computing. Cloud user asks for resources in terms of a lease. Lease stores the information about required resources and the time at which these resources are required. Cloud provider accepts the lease if it can provide guarantee for assigning resources at asked time to the cloud user. Better scheduling algorithm can accept more number of leases and hence give better resource utilization. Cloud provides four types of leases: immediate, advance reservation, best effort and deadline sensitive. Immediate allocation policy accepts the lease if resources are available, else it rejects the lease. Advance reservation policy accepts the lease if resources are available at the asked time, else it rejects the lease. Best effort allocation policy accepts the lease as soon as the resources are available. Deadline sensitive leases have parameters like required resources, startTime, endTime and duration. Scheduler can accept such lease by providing required resources for the asked duration of time between given startTime and endTime. Haizea is a resource lease manager which handles the scheduling of the lease. Proposed algorithm extends the current scheduling algorithm of Haizea for deadline sensitive type of leases. Aim of the thesis is to improve resource utilization by extending the current scheduling algorithms of Haizea. Proposed scheduling algorithm accepts more number of leases by dividing a deadline sensitive lease into multiple slots and by back filling already.Item Open Access Use of probabilistic context free grammar for natural language interface for an application(Dhirubhai Ambani Institute of Information and Communication Technology, 2008) Agarwal, Chetan; Jotwani, Naresh D.This thesis report deals with the development of a natural language interface for a database application (library system). This application uses Probabilistic Context Free Grammar as a computation model. The material presented in this thesis provides an overview to study the topics on Natural Language Processing, Probabilistic Context Free Grammar, Parsing and extracting the semantic from a pare tree. Probabilistic Context Free Grammar is a computational model which defines probabilistic relationships among a set of production rules for a given grammar. These probabilistic relationships among production rules have several advantages in natural language processing. The goal of natural language processing is to build computational models of Natural Languages for its analysis and generation. Application build takes a simple English sentence, parses the sentence, extracts the semantic and translates it into an SQL query. Application (library system) is coded in programming language JAVA. Though the given code is for a simple library system but can be modified according to requirements fulfilling the criteria of targeted task.Item Open Access Web services policy in grid(Dhirubhai Ambani Institute of Information and Communication Technology, 2008) Desai, Amee Anilbhai; Chaudhary, SanjayService-oriented computing enables service providers to publish their business functionalities in the form of abstract contracts, which can be discovered by service consumers based on open and standard protocols. Enterprise may be running a number of multiple business processes in parallel, which may require different services to fulfil the functionality. There are number of factors that both service provider and service consumer should consider before they interact with each other. Web services standards are used for acquiring interoperability among services for large scale adoption of architecture. In Web service selection phase without the use of policy, a service consumer selects the Web service which matches the functional requirements. For satisfying non-functional requirements of a service consumer, policy is used in Web service selection phase. This thesis proposes an approach and architecture to select Web services based on WS-Policy in grid. Service selection depends on metadata and policy. There is a need for dynamic selection services based on runtime environment such as content (semantics), and contract (policy). This thesis proposes an approach and architecture for dynamic selection of services based on policy and semantic .To provide better search, query, composition, and management, there is a need for mechanism to group these services based on the requirements of clients and business processes. This thesis proposes context and location based approach for service grouping and group notification. Context and location provide powerful mechanism for the better search, query, grouping and group notification to the services, and it allows customization based on user preferences, role, and location to improve personalization. The thesis proposes context and location driven grid business process to aggregate information from multiple sources according to the preferences of clients. A policy based service grouping approach is used to aggregate services. For achieving location driven approach, this thesis develops virtual organization and for specifying preferences in virtual organization, a policy is used.Item Open Access Checkpointing and recovery mechanism in grid(Dhirubhai Ambani Institute of Information and Communication Technology, 2007) Mehta, Janki; Chaudhary, SanjayGrid is a collection of distributed computing resources that performs tasks in co-ordination to achieve high-end computational capabilities. Grid Computing is a collective computing of a given task by breaking it into sub-tasks. Each sub-task could be large and run for several hours or days on a number of grid nodes. If a sub-task fails to complete even on a single site, all the computations need to be done again. In scalable distributed systems, individual component failures usually does not result in failure of the entire system. However, a single failure may crash an entire parallel application. Grid is dynamic in nature. Since the probability of a single component failure rises rapidly with the number of components in the system, as system grows in size, efficient recovery mechanism is most important for highly parallel mission critical and long running applications of grid environment. This thesis addresses a recovery mechanism using checkpoints to recover from Grid Service failure resulting in task or transaction failure in Computational Grid and Data Grid which will prevent computations to be restarted from scratch. Grid Service may fail as a result of hardware or software fault. A checkpoint is a point in time snapshot of a grid node in which its state information is stored. It will help in reducing the crash recovery time. This work helps in preserving two main objectives of grid namely optimal resource utilization and speedy computations which can be achieved by using resources in a better way for improving performance of system rather than engaging them in tasks like rollbacks resulting from cascading aborts. The saved state using checkpoints can also be used for job migration using job schedulers of grid on occurrence of critical failures like Operating System failure. Experiments conducted provide integration of proposed mechanism with standard grid Web Service Resource Framework and will aid in future development work.Item Open Access Non-uniform information dissemination for performance discovery in computational grids(Dhirubhai Ambani Institute of Information and Communication Technology, 2005) Patel, Dhawal B.; Chaudhary, SanjayThe required service in any resource-sharing environments like Grid, Peer-to-Peer etc., is discovery of resources. A resource discovery mechanism returns locations of resources that match the description, given a description of resource desired. Two resource-sharing environments are well defined with respect to target communities, resources, applications, scalability and fault tolerance: Grid and peer-to-peer systems. Grids are sharing environments that rely on persistent, standards-based service infrastructure that allow location independent access to resources and services, which are provided by geographically distributed machines and networks. The design of the resource discovery approach must follow the rules imposed by the characteristics of grid environment. These characteristics are 1. Independence from central global control, 2. Support for attribute-based search, 3. Scalability, 4. Support for intermittent resource participation. Depending upon the types of resources that are shared, the grids can also be of different types, e.g. computational grids for the environment in which only computational resources are shared, data grids for the one in which data are shared. The focus of thesis is on performance discovery in computational grids. Grid schedulers, that manages the resources, requires up-to-date information about widely distributed resources in the Grid. This is a challenging problem given the scale of grid, and the continuous change in the state of resources. Several non-uniform information dissemination protocols have been proposed by researchers to efficiently propagate information to distributed repositories, without requiring flooding or centralized approaches. Recently, a new concept called the “Grid potential” proposed in, as the first step towards the design of non-uniform information dissemination protocols. In this thesis, four non-uniform dissemination protocols are analyzed for computational grids based on the concept of “Grid potential”, which follows above-mentioned requirements for resource discovery. These protocols disseminate resource information with a resolution inversely proportional to the distance of resources from the application launch point. The performance evaluation is done with respect to the dissemination efficiency and message complexity. The results indicate that these protocols improve the performance of information dissemination compared to uniform dissemination to all repositories.