Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network

Open Access. Powered by Scholars. Published by Universities.®

Other

Computer Science and Engineering Theses

Theses/Dissertations

2011

Articles 1 - 7 of 7

Full-Text Articles in Entire DC Network

Concurrent Polyglot: An Extensible Compiler Framework, Saurabh Satish Kothari Jan 2011

Concurrent Polyglot: An Extensible Compiler Framework, Saurabh Satish Kothari

Computer Science and Engineering Theses

We have today crossed the threshold of increasing clock frequencies as the dominant solution to faster computing, and it is imperative for software developers to be able to think in the concurrent and parallel paradigm. Important still is to equip programmers with the right tools to develop concurrent and parallel software. Software concurrency is a widely researched area, and many of today's compilers concentrate on compiling for parallelism. However, although concurrent compilers have been explored since the 1970s, very few of them exist today that justify multicore environments. For instance, gmake [1] supports coarse grained parallelism through the -j option …


Privacy For Location Based Services With Smartphones, James Nathaniel Spargo Jan 2011

Privacy For Location Based Services With Smartphones, James Nathaniel Spargo

Computer Science and Engineering Theses

In recent years, mobile devices and smartphones enabled with GPS and Inter-net access have become extremely common. People use these devices as they woulda personal computer for easy access to information. Location Based Services (LBS)provide customized information based on a user's geographic location that has beenretrieved from a dedicated spatial database such as Google Places, Yahoo's LocalSearch Web Services and Yelp.com. This information can include nearby hotels andrestaurants, gas stations, banks or other Points of Interest (POIs). Since most searchengines and databases are known to store previous queries in order to improve futuresearch results and other data analysis on previous …


Performance Tuning Of An Embedded Template Analysis Tool, Ashwin Arikere Jan 2011

Performance Tuning Of An Embedded Template Analysis Tool, Ashwin Arikere

Computer Science and Engineering Theses

As multi core processors become ubiquitous, programs must be designed to utilize the additional power at their disposal. Extracting maximum performance out of these processors requires utilizing latest parallel programming techniques as well as using the latest tools available to increase performance. This thesis delves into enhancing performance of existing programs by applying parallel techniques, utilizing performance analyzers and various other tools developed specially for multi-core system programming. We discuss these techniques and tools and also demonstrate how a Template Analysis program was modified to take advantage of the additional power a multi-core machine has over single core machines to …


Automatic Discovery Of Significant Events From Databases, Avinash Shankar Bharadwaj Jan 2011

Automatic Discovery Of Significant Events From Databases, Avinash Shankar Bharadwaj

Computer Science and Engineering Theses

The advent of the internet has caused enormous amounts of data available online causing many significant facts to be hidden within this data. Searching for a significant fact within these large datasets is a query intensive process involving large amounts of queries which needs to be executed hence slowing the process of finding the significant facts from a large dataset. In this thesis, a novel approach has been designed exploiting the mathematical characteristics of the data present in the dataset to reduce the number of queries on the dataset. A two phased approach is considered for making fact finding more …


Sybil Defense For Online Social Networks Using Partial Graph Information, Vritant Naresh Jain Jan 2011

Sybil Defense For Online Social Networks Using Partial Graph Information, Vritant Naresh Jain

Computer Science and Engineering Theses

Online social networks (OSNs) today are proprietary, in the sense that communication between users requires the users to be part of the same OSN. This raises privacy issues and reliability concerns among users, and calls for an open, interoperable, and distributed OSN infrastructure that is similar to email and would link different OSNs together. Any decentralized system, however, is vulnerable to Sybil attacks, in which an attacker claims multiple identities, called Sybils, to overwhelm the OSNs and defeat standard techniques used to protect against attacks such as message spam. The state of the art defense against these attacks is SybilInfer, …


Gpu Parallel Collections For Scala, Kishen Das Kondabagilu Rajanna Jan 2011

Gpu Parallel Collections For Scala, Kishen Das Kondabagilu Rajanna

Computer Science and Engineering Theses

A decade ago, graphics processing units have been used specifically for high-speed graphics. Of late, they are becoming more popular as general purpose parallel processors. With the release of CUDA, ATI Stream and OpenCL, programmers can now split their program execution between CPU and GPU, whenever appropriate, resulting in huge performance gain. The cost of GPU is declining and also their performance is improving faster than CPUs. Although enormous performance gains can be achieved by parallelizing the code, identifying the right candidate for GPU execution is very tricky. Coding in OpenCL is a difficult task because of the memory management …


Delay Tolerant Lazy Release Consistency For Distributed Shared Memory In Opportunistic Networks, Chance Ray Eary Jan 2011

Delay Tolerant Lazy Release Consistency For Distributed Shared Memory In Opportunistic Networks, Chance Ray Eary

Computer Science and Engineering Theses

Opportunistic networking (ON), a concept which allows a mobile wireless device to dynamically interact with other wireless devices in its immediate vicinity, is a field with great potential to improve the utility of itinerant computational platforms. While ONs increase a device's ability to interact with its peers, the fleeting and intermittent connections between devices make many traditional computer collaboration paradigms, such as distributed shared memory (DSM), virtually untenable. DSM systems, developed for traditional networks, rely on relatively stable, consistent connections among participating nodes. In an ON, connectivity among nodes is distributed in time and space making it useful for delay …