Publications without Fulltext
Permanent URI for this collectionhttps://hdl.handle.net/20.500.14288/3
Browse
259 results
Search Results
Publication Metadata only Spatial and thermal aware methods for efficient workload management in distributed data centers(Elsevier B.V., 2024) N/A; Department of Computer Engineering; Ali, Ahsan; Özkasap, Öznur; Department of Computer Engineering; Graduate School of Sciences and Engineering; College of EngineeringGeographically distributed data centers provide facilities for users to fulfill the demand of storage and computations, where most of the operational cost is due to electricity consumption. In this study, we address the problem of energy consumption of cloud data centers and identify key characteristics of techniques proposed for reducing operational costs, carbon emissions, and financial penalties due to service level agreement (SLA) violations. By considering computer room air condition (CRAC) units that utilize outside air for cooling purposes as well as temperature and space-varying properties, we propose the energy cost model which takes into account temperature ranges for cooling purposes and operations of CRAC units. Then, we propose spatio-thermal-aware algorithms to manage workload using the variation of electricity price, locational outside and within the data center temperature, where the aim is to schedule the incoming workload requests with minimum SLA violations, cooling cost, and energy consumption. We analyzed the performance of our proposed algorithms and compared the experimental results with the benchmark algorithms for metrics of interest including SLA violations, cooling cost, and overall operations cost. Modeling, experiments, and verification conducted on CloudSim with realistic data center scenarios and workload traces show that the proposed algorithms result in reduced SLA violations, save between 15% to 75% of cooling cost and between 3.89% to 39% of the overall operational cost compared to the existing solutions.Publication Metadata only Snoopie: a multi-GPU communication profiler and visualizer(Assoc Computing Machinery, 2024) Department of Computer Engineering; Issa, Mohammad Kefah Taha; Sasongko, Muhammad Aditya; Turimbetov, İlyas; Baydamirli, Javid; Sağbili, Doğan; Erten, Didem Unat; Department of Computer Engineering; Graduate School of Sciences and Engineering; College of EngineeringWith data movement becoming one of the most expensive bottlenecks in computing, the need for profiling tools to analyze communication becomes crucial for effectively scaling multi-GPU applications. While existing profiling tools including first-party software by GPU vendors are robust and excel at capturing compute operations within a single GPU, support for monitoring GPU-GPU data transfers and calls issued by communication libraries is currently inadequate. To fill these gaps, we introduce Snoopie, an instrumentation-based multi-GPU communication profiling tool built on NVBit, capable of tracking peer-to-peer transfers and GPU-centric communication library calls. To increase programmer productivity, Snoopie can attribute data movement to the source code line and the data objects involved. It comes with multiple visualization modes at varying granularities, from a coarse view of the data movement in the system as a whole to specific instructions and addresses. Our case studies demonstrate Snoopie's effectiveness in monitoring data movement, locating performance bugs in applications, and understanding concrete data transfers abstracted beneath communication libraries. The tool is publicly available at https://github.com/ParCoreLab/snoopie.Publication Metadata only GPU-initiated resource allocation for irregular workloads(Assoc Computing Machinery, 2024) Department of Computer Engineering; Turimbetov, İlyas; Sasongko, Muhammad Aditya; Erten, Didem Unat; Department of Computer Engineering; College of EngineeringGPU kernels may suffer from resource underutilization in multi-GPU systems due to insufficient workload to saturate devices when incorporated within an irregular application. To better utilize the resources in multi-GPU systems, we propose a GPU-sided resource allocation method that can increase or decrease the number of GPUs in use as the workload changes over time. Our method employs GPU-to-CPU callbacks to allowGPU device(s) to request additional devices while the kernel execution is in flight. We implemented and tested multiple callback methods required for GPU-initiated workload offloading to other devices and measured their overheads on Nvidia and AMD platforms. To showcase the usage of callbacks in irregular applications, we implemented Breadth-First Search (BFS) that uses device-initiated workload offloading. Apart from allowing dynamic device allocation in persistently running kernels, it reduces time to solution on average by 15.7% at the cost of callback overheads with a minimum of 6.50 microseconds on AMD and 4.83 microseconds on Nvidia, depending on the chosen callback mechanism. Moreover, the proposed model can reduce the total device usage by up to 35%, which is associated with higher energy efficiency.Publication Metadata only Learning Markov Chain Models from sequential data under local differential privacy(Springer Science and Business Media Deutschland Gmbh, 2024) Department of Computer Engineering; Güner, Efehan; Gürsoy, Mehmet Emre; Department of Computer Engineering; Graduate School of Sciences and Engineering; College of EngineeringMarkov chain models are frequently used in the analysis and modeling of sequential data such as location traces, time series, natural language, and speech. However, considering that many data sources are privacy-sensitive, it is imperative to design privacy-preserving methods for learning Markov models. In this paper, we propose Prima for learning discrete-time Markov chain models under local differential privacy (LDP), a state-of-the-art privacy standard. In Prima, each user locally encodes and perturbs their sequential record on their own device using LDP protocols. For this purpose, we adapt two bitvector-based LDP protocols (RAPPOR and OUE); and furthermore, we develop a novel extension of the GRR protocol called AdaGRR. We also propose to utilize custom privacy budget allocation strategies for perturbation, which enable uneven splitting of the privacy budget to better preserve utility in cases with uneven sequence lengths. On the server-side, Prima uses a novel algorithm for estimating Markov probabilities from perturbed data. We experimentally evaluate Prima using three real-world datasets, four utility metrics, and under various combinations of privacy budget and budget allocation strategies. Results show that Prima enables learning Markov chains under LDP with high utility and low error compared to Markov chains learned without privacy constraints.Publication Metadata only Building quadtrees for spatial data under local differential privacy(Springer Science and Business Media Deutschland Gmbh, 2023) Department of Computer Engineering; Alptekin, Ece; Gürsoy, Mehmet Emre; Department of Computer Engineering; Graduate School of Sciences and Engineering; College of EngineeringSpatial decompositions are commonly used in the privacy literature for various purposes such as range query answering, spatial indexing, count-of-counts histograms, data summarization, and visualization. Among spatial decomposition techniques, quadtrees are a popular and well-known method. In this paper, we study the problem of building quadtrees for spatial data under the emerging notion of Local Differential Privacy (LDP). We first propose a baseline solution inspired from a state-of-the-art method from the centralized DP literature and adapt it to LDP. Motivated by the observation that the baseline solution causes large noise accumulation due to its iterative strategy, we then propose a novel solution which utilizes a single data collection step from users, propagates density estimates to all nodes, and finally performs structural corrections to the quadtree. We experimentally evaluate the baseline solution and the proposed solution using four real-world location datasets and three utility metrics. Results show that our proposed solution consistently outperforms the baseline solution, and furthermore, the resulting quadtrees provide high accuracy in practical tasks such as spatial query answering under conventional privacy levels.Publication Metadata only HyperE2VID: improving event-based video reconstruction via hypernetworks(IEEE-Inst Electrical Electronics Engineers Inc, 2024) Ercan, Burak; Eker, Onur; Sağlam, Canberk; Erdem, Erkut; Department of Computer Engineering; Erdem, Aykut; Department of Computer Engineering; Koç Üniversitesi İş Bankası Enfeksiyon Hastalıkları Uygulama ve Araştırma Merkezi (EHAM) / Koç University İşbank Center for Infectious Diseases (KU-IS CID); College of Engineering;Event-based cameras are becoming increasingly popular for their ability to capture high-speed motion with low latency and high dynamic range. However, generating videos from events remains challenging due to the highly sparse and varying nature of event data. To address this, in this study, we propose HyperE2VID, a dynamic neural network architecture for event-based video reconstruction. Our approach uses hypernetworks to generate per-pixel adaptive filters guided by a context fusion module that combines information from event voxel grids and previously reconstructed intensity images. We also employ a curriculum learning strategy to train the network more robustly. Our comprehensive experimental evaluations across various benchmark datasets reveal that HyperE2VID not only surpasses current state-of-the-art methods in terms of reconstruction quality but also achieves this with fewer parameters, reduced computational requirements, and accelerated inference times.Publication Metadata only AffectON: Incorporating affect into dialog generation(IEEE-Inst Electrical Electronics Engineers Inc, 2023) Bucinca, Zana; Department of Computer Engineering; Yemez, Yücel; Erzin, Engin; Sezgin, Tevfik Metin; Department of Computer Engineering; Koç Üniversitesi İş Bankası Yapay Zeka Uygulama ve Araştırma Merkezi (KUIS AI)/ Koç University İş Bank Artificial Intelligence Center (KUIS AI); College of EngineeringDue to its expressivity, natural language is paramount for explicit and implicit affective state communication among humans. The same linguistic inquiry (e.g., How are you?) might induce responses with different affects depending on the affective state of the conversational partner(s) and the context of the conversation. Yet, most dialog systems do not consider affect as constitutive aspect of response generation. In this article, we introduce AffectON, an approach for generating affective responses during inference. For generating language in a targeted affect, our approach leverages a probabilistic language model and an affective space. AffectON is language model agnostic, since it can work with probabilities generated by any language model (e.g., sequence-to-sequence models, neural language models, n-grams). Hence, it can be employed for both affective dialog and affective language generation. We experimented with affective dialog generation and evaluated the generated text objectively and subjectively. For the subjective part of the evaluation, we designed a custom user interface for rating and provided recommendations for the design of such interfaces. The results, both subjective and objective demonstrate that our approach is successful in pulling the generated language toward the targeted affect, with little sacrifice in syntactic coherence.Publication Metadata only LuxTrack: activity inference attacks via smartphone ambient light sensors and countermeasures(IEEE-Inst Electrical Electronics Engineers Inc, 2024) Seyedkazemi, Seyedpayam; Saygın, Yücel; Department of Computer Engineering; Gürsoy, Mehmet Emre; Department of Computer Engineering; ; College of Engineering;Ambient light sensors (ALSs) are integrated into mobile devices to enable various functionalities, such as automatic adjustment of screen brightness and background color. ALSs can be used to record the light intensity in the surrounding environment without requiring permission from the user. However, this ability raises novel privacy risks. In this article, we propose LuxTrack, a side-channel privacy attack that uses the ALS of a smartphone to infer the user's activity on a nearby laptop using the light emitted from the laptop screen. To demonstrate LuxTrack, we developed an Android app that records the light intensity data from the ALS of a mobile device, and used this app to create an ALS light intensity data set in a controlled environment with real human subjects. From this data set, LuxTrack extracts a total of 187 features under six categories and trains six different machine learning models for activity inference. Experiments show that LuxTrack can achieve up to 80% accuracy in inferring the sites/apps the user is viewing on their laptop. We then propose three countermeasures against LuxTrack: 1) binning;2) smoothing;and 3) noise addition. We demonstrate that while these countermeasures are effective in reducing attack accuracy, they also yield a reduction in the accuracy of legitimate tasks (e.g., adjusting screen background color). By conducting a tradeoff analysis between the attack accuracy and legitimate task accuracy, we show that the choice of the right countermeasure and parameters can enable the reduction of attack accuracy to below 30% while only incurring 3% loss in legitimate task accuracy. © 2014 IEEE.Publication Metadata only Distributed asynchronous rendezvous planning on the line for multi-agent systems(Elsevier, 2024) Özsoyeller, Deniz; Department of Computer Engineering; Özkasap, Öznur; Department of Computer Engineering; College of EngineeringMulti-agent systems have become increasingly significant in various application areas such as search-andrescue, exploration, surveillance, and assembly. In this study, we focus on the asynchronous autonomous rendezvous planning in multi-robot (i.e. multi-agent) systems. The objective is that the robots located in linear environments to gather rapidly at a previously unknown rendezvous location. We consider that no robot knows the positions of the other robots and its own global position. Furthermore, the robot does not know its initial distance to any other robot. Our focus is on the asynchronous case where it is not required the robots to start executing the algorithm simultaneously. We propose and develop a rendezvous planning algorithm, namely MAR, that combines distributed coordination and online motion planning. We theoretically analyze the performance of our algorithm and show that it has a constant competitive ratio. Our extensive simulations demonstrate the performance and scalability through the analysis of the key performance metrics of interest including competitive ratio, distance traveled, total time, number of rounds, and number of meetings. Additionally, we demonstrate the performance and applicability of our algorithm MAR through experimental analysis in a realistic robotic simulator.Publication Metadata only Lessons learned from a Citizen Science Project for Natural Language Processing(Association for Computational Linguistics (ACL), 2023) Klie, Jan-Christoph; Lee, Ji-Ung; Stowe, Kevin; Moosavi, Nafise Sadat; Bates, Luke; Petrak, Dominic; de Castilho, Richard Eckart; Gurevych, Iryna; Department of Computer Engineering; Şahin, Gözde Gül; Department of Computer Engineering; Koç Üniversitesi İş Bankası Yapay Zeka Uygulama ve Araştırma Merkezi (KUIS AI)/ Koç University İş Bank Artificial Intelligence Center (KUIS AI); College of EngineeringMany Natural Language Processing (NLP) systems use annotated corpora for training and evaluation. However, labeled data is often costly to obtain and scaling annotation projects is difficult, which is why annotation tasks are often outsourced to paid crowdworkers. Citizen Science is an alternative to crowdsourcing that is relatively unexplored in the context of NLP. To investigate whether and how well Citizen Science can be applied in this setting, we conduct an exploratory study into engaging different groups of volunteers in Citizen Science for NLP by re-annotating parts of a pre-existing crowdsourced dataset. Our results show that this can yield high-quality annotations and attract motivated volunteers, but also requires considering factors such as scalability, participation over time, and legal and ethical issues. We summarize lessons learned in the form of guidelines and provide our code and data to aid future work on Citizen Science. © 2023 Association for Computational Linguistics.