ORCID Profile
0000-0001-7006-2459
Current Organisations
University of Otago
,
University of Adelaide
Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the Feedback Form.
Publisher: IEEE
Date: 07-2018
Publisher: IEEE
Date: 05-2017
Publisher: IEEE
Date: 2005
Publisher: IEEE
Date: 05-2015
Publisher: ACM
Date: 07-08-2023
Publisher: Springer Berlin Heidelberg
Date: 2005
DOI: 10.1007/11577188_25
Publisher: IEEE
Date: 09-2015
Publisher: ACM
Date: 04-08-2023
Publisher: National Library of Serbia
Date: 2023
Abstract: Conventional electronic Artificial Neural Networks (ANNs) accelerators focus on architecture design and numerical computation optimization to improve the training efficiency. However, these approaches have recently encountered bottlenecks in terms of energy efficiency and computing performance, which leads to an increase interest in photonic accelerator. Photonic architectures with low energy consumption, high transmission speed and high bandwidth have been considered as an important role for generation of computing architectures. In this paper, to provide a better understanding of optical technology used in ANN acceleration, we present a comprehensive review for the efficient photonic computing and communication in ANN accelerators. The related photonic devices are investigated in terms of the application in ANNs acceleration, and a classification of existing solutions is proposed that are categorized into optical computing acceleration and optical communication acceleration according to photonic effects and photonic architectures. Moreover, we discuss the challenges for these photonic neural network acceleration approaches to highlight the most promising future research opportunities in this field.
Publisher: Springer Berlin Heidelberg
Date: 2006
DOI: 10.1007/11859802_27
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2023
Publisher: IEEE
Date: 05-2012
Publisher: ACM
Date: 21-11-2017
Publisher: Wiley
Date: 07-08-2022
DOI: 10.1002/CPE.7253
Abstract: Blockchain has been applied in wide range of fields to guarantee security. However, it has been very challenging for blockchain to flourish in mobile environment with limited resources. Existing studies mainly assume that single mobile user can buy the whole resources from edge servers in mobile blockchain. This paper formulates the problem of maximizing the social welfare for computation offloading in mobile blockchain. A three‐stage auction scheme with approximation ratio of based on group‐buying mechanism is proposed to allocate edge server resources for mobile blockchain applications. In the first stage, the miners are ided into groups, and a Vickrey–Clarke–Groves based auction is proposed to determine the bid of each group for each edge server. In the second stage, a matching algorithm is proposed to match edge servers and Access Points for maximizing the profit of edge servers. In the third stage, the edge server resources are allocated to mobile users for mining base on the results in the above stages. We prove that our auction scheme guarantees truthfulness, in idual rationality and budget balance. Simulation results show that, the social welfare of our scheme is improved by 33.78%, 21.84%, 19.69%, and 6.69% for 1000 miners, compared with the existing works.
Publisher: IEEE
Date: 12-2014
Publisher: Springer Science and Business Media LLC
Date: 19-12-2022
Publisher: IEEE
Date: 09-2007
DOI: 10.1109/ICPP.2007.85
Publisher: China Science Publishing & Media Ltd.
Date: 2005
DOI: 10.1360/CRAD20050721
Publisher: IEEE
Date: 10-2017
DOI: 10.1109/LCN.2017.34
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2022
Publisher: No publisher found
Date: 2017
Publisher: Optica Publishing Group
Date: 07-12-2021
DOI: 10.1364/OE.430194
Abstract: The combination of three-dimensional integrated circuits (3D ICs) and Optical Network-on-Chip (ONoC) can provide significant performance gains for Chip Multi-Processors (CMPs). Multicast communication is one of the most important inter-core communication primitives, which widely exists in parallel computing applications in CMPs. However, most existing schemes only focus on the optimization of one multicast, which limits the practical applications since real systems often have to handle multiple multicasts requested from various applications concurrently. In this paper, we target on routing and wavelength assignment for multiple multicasts in 3D ONoC, with the objective of reducing the number of wavelengths required. The main idea is to develop low-complexity routing policies to reduce the number of wavelengths required for routing multiple multicasts traffic by considering the distribution of multicast nodes in 3D ONoC. Extensive simulations with different traffic profiles reveal that our proposed scheme can reduce the number of wavelengths used by 33.1% compared to other schemes. Both theoretical and simulation results show that the proposed scheme has the advantages of low routing complexity, low wavelength requirement, and good scalability.
Publisher: IEEE
Date: 04-2015
Publisher: World Scientific Pub Co Pte Lt
Date: 03-04-2017
DOI: 10.1142/S0218126617501730
Abstract: Power estimation is of great value to power-aware adaptation and power provisioning in computing platforms. Performance counter measurements are widely used as main input of the power estimation. However, the number of hardware counters that can be simultaneously measured is relatively small, and the number of OS-level counters is usually far from endurable. As a result, how to pick up the most significant counters becomes an important pre-step of performance counters based power consumption modeling. As the most important criteria of counter selection, correlation between counter measurement and power dissipation has been widely used for several decades, and thus correlation ranking becomes a typical technique for counter selection. However, few works discuss its accuracy and the question why it should be the general first priority. This paper investigates the weightiness of the correlation ranking in counter selection for power estimation. Through comparing correlation ranking with several popular feature selection approaches on tremendous workloads on single and multiple core platforms, we obtain that correlation ranking is not optimal on a large number of benchmarks. Therefore, it can be concluded that correlation ranking should not be generally considered as the first priority to select performance counters. This paper provides an indication for potential researchers to be aware of these issues when estimating power dissipation.
Publisher: Springer Science and Business Media LLC
Date: 23-11-2022
Publisher: Springer International Publishing
Date: 2022
Publisher: Springer International Publishing
Date: 2022
Publisher: IEEE
Date: 06-2018
Publisher: IEEE
Date: 09-2015
Publisher: IEEE
Date: 10-12-2021
Publisher: Springer Science and Business Media LLC
Date: 19-01-2013
Publisher: Springer Science and Business Media LLC
Date: 29-12-2017
Publisher: Oxford University Press (OUP)
Date: 14-03-2016
Publisher: Wiley
Date: 16-09-2017
DOI: 10.1002/CPE.3938
Publisher: IEEE
Date: 12-2013
Publisher: IEEE
Date: 09-2016
DOI: 10.1109/MCSOC.2016.9
Publisher: Springer Science and Business Media LLC
Date: 22-01-2014
Publisher: Elsevier BV
Date: 2021
Publisher: Springer Science and Business Media LLC
Date: 09-2015
Publisher: Association for Computing Machinery (ACM)
Date: 26-10-2017
DOI: 10.1145/3122984
Abstract: Mobile opportunistic networking is a promising technology that can supplement existing cellular and WiFi networks to provide desirable services for smart and connected communities. Message routing is the most compelling challenge in mobile opportunistic networks due to the lack of contemporaneous end-to-end paths and the resource constraints at mobile devices. To improve the probability of successful message delivery, most existing routing schemes use the past contact history to predict future contacts for message forwarding, and exploit message replication and redundancy for multicopy routing. However, most existing prediction-based routing schemes simply use the average pairwise contact probability as the routing metric and neglect the benefits of exploring fine-grained contact information such as pairwise repeated contact patterns to improve the accuracy of predicting future contacts. Moreover, there is no efficient mechanism that can adaptively control message replication in a decentralized manner to achieve both high probability of successful message delivery and low message overhead. To address these problems, we present FGAR, a routing protocol designed for mobile opportunistic networks by leveraging fine-grained contact characterization and adaptive message replication. In FGAR, contact history is characterized in a fine-grained manner with timing information using a sliding window mechanism, and future contacts are predicted based on the fine-grained contact information, thereby improving the accuracy of contact prediction. We further design an efficient message replication scheme in which message replication is controlled in a fully decentralized manner by taking into account the expected message delivery probability, the replication history, and the quality of the encountered device. A replica is generated only when it is necessary to fulfill the expected message delivery probability. We evaluate our scheme through trace-driven simulations, and the simulation results show that FGAR outperforms existing schemes. In comparison with PRoPHET, FGAR can achieve more than 20% improvement on average on successful message delivery, whereas the message overhead has been reduced by a factor up to 15.
Publisher: Springer Science and Business Media LLC
Date: 02-04-2018
Publisher: Springer Science and Business Media LLC
Date: 17-07-2017
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2023
Publisher: IEEE
Date: 07-2018
Publisher: IEEE
Date: 11-2007
Publisher: IEEE
Date: 08-2009
Publisher: IEEE
Date: 10-2019
Publisher: Springer Science and Business Media LLC
Date: 04-2006
Publisher: Springer Singapore
Date: 2020
Publisher: Elsevier BV
Date: 05-2017
Publisher: Association for Computing Machinery (ACM)
Date: 31-03-2019
DOI: 10.1145/3309763
Abstract: Radio links in wireless body area networks (WBANs) commonly experience highly time-varying attenuation due to the dynamic network topology and frequent occlusions caused by body movements, making it challenging to design a reliable, energy-efficient, and real-time communication protocol for WBANs. In this article, we present Chimp, a learning-based power-aware communication protocol in which each sending node can self-learn the channel quality and choose the best transmission power level to reduce energy consumption and interference range while still guaranteeing high communication reliability. Chimp is designed based on learning automata that uses only the acknowledgment packets and motion data from a local gyroscope sensor to infer the real-time channel status. We design a new cost function that takes into account the energy consumption, communication reliability and interference and develop a new learning function that can guarantee to select the optimal transmission power level to minimize the cost function for any given channel quality. For highly dynamic postures such as walking and running, we exploit the correlation between channel quality and motion data generated by a gyroscope sensor to fastly estimate channel quality, eliminating the need to use expensive channel s ling procedures. We evaluate the performance of Chimp through experiments using TelosB motes equipped with the MPU-9250 motion sensor chip and compare it with the state-of-the-art protocols in different body postures. Experimental results demonstrate that Chimp outperforms existing schemes and works efficiently in most common body postures. In high-date-rate scenarios, it achieves almost the same performance as the optimal power assignment scheme in which the optimal power level for each transmission is calculated based on the collected channel measurements in an off-line manner.
Publisher: Elsevier BV
Date: 05-2011
Publisher: Optica Publishing Group
Date: 17-03-2021
DOI: 10.1364/OE.419003
Abstract: Optical network-on-chip (ONoC) is an effective communication architecture to realize high performance and energy efficiency. Diverse routing algorithms are proposed to avoid the congestion, tolerate the faults, and reduce the insertion loss or energy consumption. However, existing algorithms did not consider the characteristic optical circuit-switching of ONoC, which aggravates the network congestion and degrades the associated performance severely. In this paper, by exploiting congestion prediction technique, we propose a new routing algorithm for ONoC, named loophole-routing, to improve the success rate of path-setup and decrease the latency. We use the congestion prediction technique to analyze the latency and predict the port condition caused by the network congestion. Theoretical analysis and experimental results of different synthetic traffic patterns show that the loophole-routing improves network latency over XY routing and OE-turn routing by 15.56%, 25.71%, 18.92%, 66.67% and 42.86% under uniform, hotspot1, hotspot2, transpose2 and transpose3 traffic patterns while improving the saturation throughput by 31.43%, 34.33%, 35.29%, 67.86% and 99.5% under uniform, hotspot1, hotspot2, transpose2 and transpose3 traffic patterns on average than XY routing. In addition, our proposed loophole-routing has the benefits of high path ersity and adaptive degree and low computing complexity and overhead and the potential to make fault-tolerant path selection.
Publisher: Association for Computing Machinery (ACM)
Date: 09-09-2023
DOI: 10.1145/3607920
Publisher: IEEE
Date: 11-2006
Publisher: Springer Science and Business Media LLC
Date: 25-01-2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2022
Publisher: Elsevier BV
Date: 04-2016
Publisher: IEEE
Date: 12-2018
Publisher: IEEE
Date: 06-2020
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-2019
Publisher: Elsevier BV
Date: 2010
Publisher: IEEE
Date: 12-2012
Publisher: IEEE
Date: 05-2016
Publisher: IEEE
Date: 06-2016
Publisher: IEEE
Date: 10-2013
Publisher: MDPI AG
Date: 06-04-2022
DOI: 10.3390/MATH10071202
Abstract: Complex-variable chaotic systems (CVCSs) have numerous advantages over real-variable chaotic systems in chaos communication due to their increased unpredictability, confidentiality, and the ease of implementation. Synchronization between the master and slave systems in CVCSs is key to achieving encryption and decryption. However, existing synchronization schemes for CVCSs require the litude of the chaotic signal to be much larger than that of the plaintext. Moreover, traditional chaotic masking of complete synchronization (CS) requires uniformity between the transmitter and receiver ends. Therefore, we propose a complex modified projective difference function synchronization (CMPDFS) of CVCSs to address these issues, where the modified projective matrix helps address the issues with the litude. The receiver end is reconstructed without uniformity of the transmitter. We design the CMPDFS controller and propose a new secure communication scheme for wireless sensor networks (WSNs). The basic principle is fundamentally different from traditional chaotic masking. Simulation results and security analysis demonstrate that the CMPDFS communication scheme has a large key space, high sensitivity to encryption keys, high security, and an acceptable encryption speed. Hence, the proposed scheme can improve the security of WSNs. Moreover, it also can be applied to similar communication systems.
Publisher: Elsevier BV
Date: 07-2017
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 08-2011
DOI: 10.1109/TC.2010.275
Publisher: World Scientific Pub Co Pte Lt
Date: 17-05-2016
DOI: 10.1142/S0218126616500869
Abstract: Performance monitoring counters (PMCs) are of great value to monitor the status of processors and their further analysis and modeling. In this paper, we explore a novel problem called PMC integration, i.e., how to combine a group of PMCs which are collected asynchronously together. It is well known that, due to hardware constraints, the number of PMCs that can be measured concurrently is strictly limited. It means we cannot directly acquire all the phenomenon features that are related with the system performance. Clearly, this source raw data shortage is extremely frustrating to PMCs based analysis and modeling tasks, such as PMCs based power estimation. To deal with this problem, we introduce a neighboring interval power values based PMC data integration approach. Based on the activity similarity of easily collected power dissipation values, the proposed approach can automatically combine distinct categories of PMC data together and hence realize the recovery of intact raw PMC data. In addition, the significance and effectiveness of the proposed approach are experimentally verified on a common task, the PMCs based power consumption modeling.
Publisher: ACM
Date: 21-02-2023
Publisher: IEEE
Date: 10-2013
Publisher: IEEE
Date: 08-2019
Publisher: IEEE
Date: 09-2012
DOI: 10.1109/ICPPW.2012.5
Start Date: 2017
End Date: 2020
Funder: Marsden Fund
View Funded Activity