liu.seSearch for publications in DiVA
Change search
Link to record
Permanent link

Direct link
BETA
Bordoloi, Unmesh D.
Alternative names
Publications (10 of 25) Show all publications
Maghazeh, A., Bordoloi, U. D., Dastgeer, U., Andrei, A., Eles, P. & Peng, Z. (2017). Latency-Aware Packet Processing on CPU-GPU Heterogeneous Systems. In: DAC '17 Proceedings of the 54th Annual Design Automation Conference 2017: . Paper presented at 54th ACM/EDAC/IEEE Design Automation Conference (DAC), Austin, TX, USA, June 18-22, 2017. New York, NY, USA: Association for Computing Machinery (ACM)
Open this publication in new window or tab >>Latency-Aware Packet Processing on CPU-GPU Heterogeneous Systems
Show others...
2017 (English)In: DAC '17 Proceedings of the 54th Annual Design Automation Conference 2017, New York, NY, USA: Association for Computing Machinery (ACM), 2017Conference paper, Published paper (Refereed)
Abstract [en]

In response to the tremendous growth of the Internet, towards what we call the Internet of Things (IoT), there is a need to move from costly, high-time-to-market specific-purpose hardware to flexible, low-time-to-market general-purpose devices for packet processing. Among several such devices, GPUs have attracted attention in the past, mainly because the high computing demand of packet processing applications can, potentially, be satisfied by these throughput-oriented machines. However, another important aspect of such applications is the packet latency which, if not handled carefully, will overshadow the throughput benefits. Unfortunately, until now, this aspect has been mostly ignored. To address this issue, we propose a method that considers the variable bit rate of the traffic and, depending on the current rate, minimizes the latency, while meeting the rate demand. We propose a persistent kernel based software architecture to overcome the challenges inherent in GPU implementation like kernel invocation overhead, CPU-GPU communication and memory access overhead. We have chosen packet classification as the packet processing application to demonstrate our technique. Using the proposed approach, we are able to reduce the packet latency on average by a factor of 3.5, compared to the state-of-the-art solutions, without any packet drop.

Place, publisher, year, edition, pages
New York, NY, USA: Association for Computing Machinery (ACM), 2017
Series
Design Automation Conference DAC, ISSN 0738-100X
National Category
Computer Sciences
Identifiers
urn:nbn:se:liu:diva-141212 (URN)10.1145/3061639.3062269 (DOI)000424895400129 ()2-s2.0-85023612665 (Scopus ID)978-1-4503-4927-7 (ISBN)
Conference
54th ACM/EDAC/IEEE Design Automation Conference (DAC), Austin, TX, USA, June 18-22, 2017
Available from: 2017-09-27 Created: 2017-09-27 Last updated: 2018-12-07Bibliographically approved
Tanasa, B., Bordoloi, U. D., Eles, P. & Peng, Z. (2016). Correlation-Aware Probabilistic Timing Analysis for the Dynamic Segment of FlexRay. ACM Transactions on Embedded Computing Systems, 15(3), 54:1-54:31
Open this publication in new window or tab >>Correlation-Aware Probabilistic Timing Analysis for the Dynamic Segment of FlexRay
2016 (English)In: ACM Transactions on Embedded Computing Systems, ISSN 1539-9087, E-ISSN 1558-3465, Vol. 15, no 3, p. 54:1-54:31Article in journal (Refereed) Published
Abstract [en]

We propose an analytical framework for probabilistic timing analysis of the event-triggered Dynamic segment of the FlexRay communication protocol. Specifically, our framework computes the Deadline Miss Ratio of each message. The core problem is formulated as a Mixed Integer Linear Program (MILP). Given the intractability of the problem, we also propose several techniques that help to mitigate the running times of our tool. This includes the re-engineering of the problem to run it on GPUs as well as reformulating the MILP itself.

Most importantly, we also show how our framework can handle correlations between the queuing events of messages. This is challenging because one cannot apply the convolution operator in the same way as in the case of independent queuing events.

Place, publisher, year, edition, pages
Association for Computing Machinery (ACM), 2016
Keywords
Automotive networks, correlations, deadline miss ratio, dynamic seg- ment, flexray, probabilistic analysis, timing analysis
National Category
Computer Sciences
Identifiers
urn:nbn:se:liu:diva-128836 (URN)10.1145/2870635 (DOI)000381422700015 ()
Available from: 2016-06-01 Created: 2016-06-01 Last updated: 2018-01-10
Maghazeh, A., Bordoloi, U. D., Villani, M., Eles, P. & Peng, Z. (2015). Perception-aware power management for mobile games via dynamic resolution scaling. In: 2015 IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN (ICCAD): . Paper presented at Computer-Aided Design (ICCAD), 2015 IEEE/ACM International Conference on 2-6 Nov. 2015 Austin, TX (pp. 613-620). IEEE
Open this publication in new window or tab >>Perception-aware power management for mobile games via dynamic resolution scaling
Show others...
2015 (English)In: 2015 IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN (ICCAD), IEEE , 2015, p. 613-620Conference paper, Published paper (Refereed)
Abstract [en]

Modern mobile devices provide ultra-high resolutions in their display panels. This imposes ever increasing workload on the GPU leading to high power consumption and shortened battery life. In this paper, we first show that resolution scaling leads to significant power savings. Second, we propose a perception-aware adaptive scheme that sets the resolution during game play. We exploit the fact that game players are often willing to trade quality for longer battery life. Our scheme uses decision theory, where the predicted user perception is combined with a novel asymmetric loss function that encodes users' alterations in their willingness to save power.

Place, publisher, year, edition, pages
IEEE, 2015
Series
ICCAD-IEEE ACM International Conference on Computer-Aided Design, ISSN 1933-7760
National Category
Computer Sciences
Identifiers
urn:nbn:se:liu:diva-124543 (URN)10.1109/ICCAD.2015.7372626 (DOI)000368929600084 ()978-1-4673-8388-2 (ISBN)
Conference
Computer-Aided Design (ICCAD), 2015 IEEE/ACM International Conference on 2-6 Nov. 2015 Austin, TX
Available from: 2016-02-02 Created: 2016-02-02 Last updated: 2018-12-07
Tanasa, B., Bordoloi, U. D., Eles, P. & Peng, Z. (2015). Probabilistic Response Time and Joint Analysis of Periodic Tasks. In: PROCEEDINGS OF THE 2015 27TH EUROMICRO CONFERENCE ON REAL-TIME SYSTEMS (ECRTS 2015): . Paper presented at 27th Euromicro Conference on Real-Time Systems (ECRTS), Lund, Sweden, 8-10 July 2015 (pp. 235-246). IEEE Communications Society
Open this publication in new window or tab >>Probabilistic Response Time and Joint Analysis of Periodic Tasks
2015 (English)In: PROCEEDINGS OF THE 2015 27TH EUROMICRO CONFERENCE ON REAL-TIME SYSTEMS (ECRTS 2015), IEEE Communications Society, 2015, p. 235-246Conference paper, Published paper (Refereed)
Abstract [en]

In this paper we address the problem of computing the probability response time distribution of periodic tasks scheduled on a uniprocessor systems. Our framework assumes an arbitrary non-idling preemptive scheduling policy that may be either a fixed-priority scheduler (such as Rate Monotonic - RM) or a dynamic-priority scheduler (such as Earliest Deadline First - EDF). At the same time, our framework can handle arbitrary execution time distributions arbitrary deadlines providing numerically accurate results. We also show how the framework can be extended to compute the correlation coefficients between the response times of different jobs by performing the joint analysis.

Place, publisher, year, edition, pages
IEEE Communications Society, 2015
Series
Euromicro Conference on Real-Time Systems. Proceedings, ISSN 1068-3070
National Category
Computer Sciences
Identifiers
urn:nbn:se:liu:diva-123742 (URN)10.1109/ECRTS.2015.28 (DOI)000375052900021 ()978-1-4673-7570-2 (ISBN)
Conference
27th Euromicro Conference on Real-Time Systems (ECRTS), Lund, Sweden, 8-10 July 2015
Available from: 2016-01-11 Created: 2016-01-11 Last updated: 2018-01-10Bibliographically approved
Aragon, E., Jimenez, J. M., Maghazeh, A., Rasmusson, J. & Bordoloi, U. D. (2014). Pattern matching in OpenCL: GPU vs CPU energy consumption on two mobile chipsets. In: Proceedings of the International Workshop / OpenCL 2013 & 2014 (IWOCL '14): . Paper presented at 2nd International Workshop on OpenCL (IWOCL 2014), Bristol, UK, May 12-14, 2014 (pp. Article No. 5). ACM Digital Library
Open this publication in new window or tab >>Pattern matching in OpenCL: GPU vs CPU energy consumption on two mobile chipsets
Show others...
2014 (English)In: Proceedings of the International Workshop / OpenCL 2013 & 2014 (IWOCL '14), ACM Digital Library, 2014, p. Article No. 5-Conference paper, Published paper (Other academic)
Abstract [en]

Adaptations of the Aho-Corasick (AC) algorithm on high performance graphics processors (also called GPUs) have garnered increasing attention in recent years. However, no results have been reported regarding their implementations on mobile GPUs. In this paper, we show that implementing a state-of-the-art Aho-Corasick parallel algorithm on a mobile GPU delivers significant speedups. We study a few implementation optimizations some of which may seem counter-intuitive to standard optimizations for high-end GPUs. More importantly, we focus on measuring the energy consumed by different components of the OpenCL application rather than reporting the aggregate. We show that there are considerable energy savings compared to the CPU implementation of the AC algorithm.

Place, publisher, year, edition, pages
ACM Digital Library, 2014
National Category
Computer Sciences
Identifiers
urn:nbn:se:liu:diva-121564 (URN)10.1145/2664666.2664671 (DOI)978-1-4503-3007-7 (ISBN)
Conference
2nd International Workshop on OpenCL (IWOCL 2014), Bristol, UK, May 12-14, 2014
Available from: 2015-09-25 Created: 2015-09-25 Last updated: 2018-01-11Bibliographically approved
Schneider, R., Goswami, D., Chakraborty, S., Bordoloi, U., Eles, P. I. & Peng, Z. (2014). Quantifying Notions of Extensibility in FlexRay Schedule Synthesis. ACM Transactions on Design Automation of Electronic Systems, 19(4), 32
Open this publication in new window or tab >>Quantifying Notions of Extensibility in FlexRay Schedule Synthesis
Show others...
2014 (English)In: ACM Transactions on Design Automation of Electronic Systems, ISSN 1084-4309, E-ISSN 1557-7309, Vol. 19, no 4, p. 32-Article in journal (Refereed) Published
Abstract [en]

FlexRay has now become a well-established in-vehicle communication bus at most original equipment manufacturers (OEMs) such as BMW, Audi, and GM. Given the increasing cost of verification and the high degree of crosslinking between components in automotive architectures, an incremental design process is commonly followed. In order to incorporate FlexRay-based designs in such a process, the resulting schedules must be extensible, that is: (i) when messages are added in later iterations, they must preserve deadline guarantees of already scheduled messages, and (ii) they must accommodate as many new messages as possible without changes to existing schedules. Apart from extensible scheduling having not received much attention so far, traditional metrics used for quantifying them cannot be trivially adapted to FlexRay schedules. This is because they do not exploit specific properties of the FlexRay protocol. In this article we, for the first time, introduce new notions of extensibility for FlexRay that capture all the protocol-specific properties. In particular, we focus on the dynamic segment of FlexRay and we present a number of metrics to quantify extensible schedules. Based on the introduced metrics, we propose strategies to synthesize extensible schedules and compare the results of different scheduling algorithms. We demonstrate the applicability of the results with industrial-size case studies and also show that the proposed metrics may also be visually represented, thereby allowing for easy interpretation.

Place, publisher, year, edition, pages
Association for Computing Machinery (ACM), 2014
Keywords
Design; Algorithms; Performance; FlexRay; extensibility; schedule synthesis; automotive
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:liu:diva-110978 (URN)10.1145/2647954 (DOI)000341232600001 ()
Available from: 2014-10-01 Created: 2014-10-01 Last updated: 2018-01-11Bibliographically approved
Maghazeh, A., Bordoloi, U. D., Horga, A., Eles, P. & Peng, Z. (2014). Saving Energy without Defying Deadlines on Mobile GPU-based Heterogeneous Systems. In: 2014 International Conference on Hardware/Software Codesign and System Synthesis: . Paper presented at International Conference on Hardware/Software Codesign and System Synthesis (CODES+ISSS 2014), New Delhi, India, October 12-17, 2014. Association for Computing Machinery (ACM)
Open this publication in new window or tab >>Saving Energy without Defying Deadlines on Mobile GPU-based Heterogeneous Systems
Show others...
2014 (English)In: 2014 International Conference on Hardware/Software Codesign and System Synthesis, Association for Computing Machinery (ACM), 2014Conference paper, Published paper (Refereed)
Abstract [en]

With the advent of low-power programmable compute cores based on GPUs, GPU-equipped heterogeneous platforms are becoming common in a wide spectrum of industries including safety-critical domains like the automotive industry. While the suitability of GPUs for throughput oriented applications is well-accepted, their applicability for real-time applications remains an open issue. Moreover, in mobile/embedded systems, energy-efficient computing is a major concern and yet, there has been no systematic study on the energy savings that GPUs may potentially provide. In this paper, we propose an approach to utilize both the GPU and the CPU in a heterogeneous fashion to meet the deadlines of a real-time application while ensuring that we maximize the energy savings. We note that GPUs are inherently built to maximize the throughput and this poses a major challenge when deadlines must be satisfied. The problem becomes more acute when we consider the fact that GPUs are more energy efficient than CPUs and thus, a naive approach that is based on maximizing GPU utilization might easily lead to infeasible solutions from a deadline perspective.

Place, publisher, year, edition, pages
Association for Computing Machinery (ACM), 2014
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:liu:diva-112689 (URN)10.1145/2656075.2656097 (DOI)978-1-4503-3051-0 (ISBN)
Conference
International Conference on Hardware/Software Codesign and System Synthesis (CODES+ISSS 2014), New Delhi, India, October 12-17, 2014
Available from: 2014-12-08 Created: 2014-12-08 Last updated: 2018-12-07Bibliographically approved
Bordoloi, U. D., Aminifar, A., Eles, P. & Peng, Z. (2014). Schedulability Analysis of Ethernet AVB Switches. In: 20th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2014), Chongqing, China, Aug. 20-22, 2014.: . Paper presented at 20th IEEE International Conference on Embedded and Real- Time Computing Systems and Applications (RTCSA 2014).. IEEE Computer Society
Open this publication in new window or tab >>Schedulability Analysis of Ethernet AVB Switches
2014 (English)In: 20th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2014), Chongqing, China, Aug. 20-22, 2014., IEEE Computer Society, 2014Conference paper, Published paper (Refereed)
Abstract [en]

Ethernet AVB is being actively considered by the automotive industry as a candidate for in-vehicle communication backbone. However, several questions pertaining to schedulability of hard real-time messages transmitted via such a switch remain unanswered. In this paper, we attempt to fill this void. We derive equations to perform worst-case response time analysis on Ethernet AVB switches by considering its credit-based shaping algorithm. Also, we propose several approaches to reduce the pessimism in the analysis to provide tighter bounds.

Place, publisher, year, edition, pages
IEEE Computer Society, 2014
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:liu:diva-112692 (URN)10.1109/RTCSA.2014.6910530 (DOI)000352610400034 ()9781479939534 (Local ID)9781479939534 (Archive number)9781479939534 (OAI)
Conference
20th IEEE International Conference on Embedded and Real- Time Computing Systems and Applications (RTCSA 2014).
Available from: 2014-12-08 Created: 2014-12-08 Last updated: 2018-01-11
Bordoloi, U. & Samii, S. (2014). The Frame Packing Problem for CAN-FD. In: Real-Time Systems Symposium (RTSS 2014), Rome, Italy, Dec. 2-5, 2014.: . Paper presented at RTSS 14 (pp. 284-293). IEEE Press
Open this publication in new window or tab >>The Frame Packing Problem for CAN-FD
2014 (English)In: Real-Time Systems Symposium (RTSS 2014), Rome, Italy, Dec. 2-5, 2014., IEEE Press, 2014, p. 284-293Conference paper, Published paper (Refereed)
Abstract [en]

CAN with flexible data rate (CAN-FD) allows transmission of larger payloads compared to standard CAN. However, efficient utilization of CAN-FD bandwidth space calls for a systematic strategy. The challenge arises from the nature of the frame sizes stipulated by CAN-FD as well as the heterogeneity of the periods of the messages and the signals. In this paper, we formulate a frame packing problem for CAN-FD with the optimization objective of bandwidth utilization while meeting temporal constraints. As part of the solution, first, we propose a formula to compute the best-case and the worst-case transmission times of the CAN-FD frames. Thereafter, we propose a framework that solves the optimization problem in pseudo-polynomial time. Experiments show the gains achieved by our framework. The results also show that, when applied to standard CAN, our heuristic provides improved results over existing techniques.

Place, publisher, year, edition, pages
IEEE Press, 2014
Series
Real-Time Systems Symposium, ISSN 1052-8725
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:liu:diva-114468 (URN)10.1109/RTSS.2014.8 (DOI)
Conference
RTSS 14
Available from: 2015-02-20 Created: 2015-02-20 Last updated: 2018-01-11
Maghazeh, A., Bordoloi, U. D., Eles, P. & Peng, Z. (2013). General Purpose Computing on Low-Power Embedded GPUs: Has It Come of Age?. In: 13th International Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation (SAMOS 2013), Samos, Greece, July 15-18, 2013.: . Paper presented at SAMOS'13. IEEE Press
Open this publication in new window or tab >>General Purpose Computing on Low-Power Embedded GPUs: Has It Come of Age?
2013 (English)In: 13th International Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation (SAMOS 2013), Samos, Greece, July 15-18, 2013., IEEE Press, 2013Conference paper, Published paper (Refereed)
Abstract [en]

In this paper we evaluate the promise held by low power GPUs for non-graphic workloads that arise in embedded systems. Towards this, we map and implement 5 benchmarks, that find utility in very different application domains, to an embedded GPU. Our results show that apart from accelerated performance, embedded GPUs are promising also because of their energy efficiency which is an important design goal for battery-driven mobile devices. We show that adopting the same optimization strategies as those used for programming high-end GPUs might lead to worse performance on embedded GPUs. This is due to restricted features of embedded GPUs, such as, limited or no user-defined memory, small instruction-set, limited number of registers, among others. We propose techniques to overcome such challenges, e.g., by distributing the workload between GPUs and multi-core CPUs, similar to the spirit of heterogeneous computation.

Place, publisher, year, edition, pages
IEEE Press, 2013
National Category
Computer Sciences
Identifiers
urn:nbn:se:liu:diva-92626 (URN)10.1109/SAMOS.2013.6621099 (DOI)000332458100004 ()
Conference
SAMOS'13
Available from: 2013-05-14 Created: 2013-05-14 Last updated: 2018-12-07
Organisations

Search in DiVA

Show all publications