2015 18th CSI International Symposium on Computer Architecture and Digital Systems (CADS)最新文献

筛选
英文 中文
GreenDPA: Thermal-aware execution of Data Parallel Applications 数据并行应用程序的热感知执行
Bagher Salami, Abdorreza Savadi, Hamid Noori
{"title":"GreenDPA: Thermal-aware execution of Data Parallel Applications","authors":"Bagher Salami, Abdorreza Savadi, Hamid Noori","doi":"10.1109/CADS.2015.7377787","DOIUrl":"https://doi.org/10.1109/CADS.2015.7377787","url":null,"abstract":"Parallel execution of programs improves performance substantially, at the cost of more power consumption, and higher temperature that threatens system reliability, decreases both transistor age and transition speed and increases the leakage current. In this paper, we propose a method for thermal-aware parallel execution of data parallel programs. Our scheme utilizes an advanced resource predictor to estimate the CPU frequency and number of cores considering the desired temperature threshold. The experimental results indicate that our proposed method outperforms standard OpenCL matrix multiplication in reducing average and peak temperatures with an increase of runtime execution without any violation from temperature threshold.","PeriodicalId":376013,"journal":{"name":"2015 18th CSI International Symposium on Computer Architecture and Digital Systems (CADS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123003568","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
LTS: Linear task scheduling on multiprocessor through equation of the line LTS:基于直线方程的多处理机线性任务调度
Abolfazl Ghavidel, Mohammad Hajibegloo, Abdorreza Savadi, Yasser Sedaghat
{"title":"LTS: Linear task scheduling on multiprocessor through equation of the line","authors":"Abolfazl Ghavidel, Mohammad Hajibegloo, Abdorreza Savadi, Yasser Sedaghat","doi":"10.1109/CADS.2015.7377777","DOIUrl":"https://doi.org/10.1109/CADS.2015.7377777","url":null,"abstract":"Real-time task scheduling in embedded multiprocessor systems, as the name implies, is known as a problem because of two major difficulties: identifying tasks' priority and task assignment issue. The former, has especially a significant importance in the case of global real-time scheduling on symmetric multiprocessor environment. The great importance of priority assignment becomes even clearer when we observe that only by using dynamic priority assignment for decision making it will be possible to reach an optimal global scheduling algorithm. In this paper, too, a novel approach (called LTS) for dynamic priority assignment of periodic real-time tasks with implicit deadline on multiprocessor is portrayed which is based on the equation of the line. In order to attain this objective, task computation time coupled with deadline time is used to generate an equation of the line to represent the priority of each task at every time unit. Then, such equation is employed so as to assign priorities to the tasks and thus, at every time unit, those tasks which hold higher priorities are selected for processors to be assigned to execute. We also introduce an essential rule for task assignment to prevent potential deadline misses. Experiments were performed on 4500 randomly generated tasksets indicating that not only can LTS schedule periodic tasksets on single processor, but it also schedules tasksets with total utilization ≤ m on multiprocessor environment with m processors safely.","PeriodicalId":376013,"journal":{"name":"2015 18th CSI International Symposium on Computer Architecture and Digital Systems (CADS)","volume":"28 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127562380","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A low power hybrid MTJ/CMOS (4-2) compressor for fast arithmetic circuits 用于快速算术电路的低功耗混合MTJ/CMOS(4-2)压缩器
V. Jamshidi, M. Fazeli, A. Patooghy
{"title":"A low power hybrid MTJ/CMOS (4-2) compressor for fast arithmetic circuits","authors":"V. Jamshidi, M. Fazeli, A. Patooghy","doi":"10.1109/CADS.2015.7377793","DOIUrl":"https://doi.org/10.1109/CADS.2015.7377793","url":null,"abstract":"Compressors are commonly employed in multipliers to reduce the number of partial products and in multi-operand adders to reduce the number of operands. In this paper, a novel magnetic tunnel junction (MTJ) and complementary metal-oxide-semiconductor (CMOS) based architecture is proposed for designing a 4-2 compressor. This architecture reduces the number of elements, connections and circuit complexity, which ultimately results in the reduction of power, delay and chip area. HSPICE Simulations for 32nm technology, through comparisons with previous works in terms of power consumption, delay and power-delay product (PDP), indicate the efficiency of the proposed 4-2 compressor.","PeriodicalId":376013,"journal":{"name":"2015 18th CSI International Symposium on Computer Architecture and Digital Systems (CADS)","volume":"250 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126721675","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Integrating Functional Mock-up units into a formal heterogeneous system modeling framework 将功能模型单元集成到正式的异构系统建模框架中
Seyed-Hosein Attarzadeh-Niaki, I. Sander
{"title":"Integrating Functional Mock-up units into a formal heterogeneous system modeling framework","authors":"Seyed-Hosein Attarzadeh-Niaki, I. Sander","doi":"10.1109/CADS.2015.7377784","DOIUrl":"https://doi.org/10.1109/CADS.2015.7377784","url":null,"abstract":"The Functional Mock-up Interface (FMI) standard defines a method for tool- and platform-independent model exchange and co-simulation of dynamic system models. In FMI, the master algorithm, which executes the imported components, is a timed differential equation solver. This is a limitation for heterogeneous embedded and cyber-physical systems, where models with different time abstractions co-exist and interact. This work integrates FMI into a heterogeneous system modeling and simulation framework as process constructors and co-simulation wrappers. Consequently, each external model communicates with the framework without unnecessary semantic adaptation while the framework provides necessary mechanisms for handling heterogeneity. The presented methods are implemented in the ForSyDe-SystemC modeling framework and tested using a case study.","PeriodicalId":376013,"journal":{"name":"2015 18th CSI International Symposium on Computer Architecture and Digital Systems (CADS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130342699","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Cost-efficient QCA reversible combinational circuits based on a new reversible gate 基于新型可逆门的高性价比QCA可逆组合电路
A. M. Chabi, A. Roohi, R. Demara, Shaahin Angizi, K. Navi, H. Khademolhosseini
{"title":"Cost-efficient QCA reversible combinational circuits based on a new reversible gate","authors":"A. M. Chabi, A. Roohi, R. Demara, Shaahin Angizi, K. Navi, H. Khademolhosseini","doi":"10.1109/CADS.2015.7377779","DOIUrl":"https://doi.org/10.1109/CADS.2015.7377779","url":null,"abstract":"Nanotechnologies, notably Quantum-dot Cellular Automata (QCA), provide an attractive perspective for future computing technologies. In this paper, Quantum-dot Cellular Automata (QCA) is investigated as an implementation method for reversible logic. A novel XOR gate and also a new approach to implement 2:1 multiplexer are presented. Moreover, an efficient and potent universal reversible gate based on the proposed XOR gate is designed. The proposed reversible gate has a superb performance in implementing the QCA standard benchmark combinational functions in terms of area, complexity, power consumption and cost function in comparison to the other reversible gates. The gate achieves the lowest overall cost among the most cost-efficient designs presented so far, with a reduction of 24%.","PeriodicalId":376013,"journal":{"name":"2015 18th CSI International Symposium on Computer Architecture and Digital Systems (CADS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131964368","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 27
Hierarchical threshold multi-secret sharing scheme based on Birkhoff interpolation and cellular automata 基于Birkhoff插值和元胞自动机的分层阈值多秘密共享方案
Ziba Eslami, Nasrollah Pakniat, Mahnaz Noroozi
{"title":"Hierarchical threshold multi-secret sharing scheme based on Birkhoff interpolation and cellular automata","authors":"Ziba Eslami, Nasrollah Pakniat, Mahnaz Noroozi","doi":"10.1109/CADS.2015.7377795","DOIUrl":"https://doi.org/10.1109/CADS.2015.7377795","url":null,"abstract":"Secret sharing is one of the main components of many security protocols that are designed to provide secure communications. In secret sharing schemes, a secret is divided into some pieces, called secret shadows and then, these shadows are shared among a group of participants. Later, authorized subsets of participants can use their shadows and reconstruct the secret. A hierarchical threshold secret sharing (HTSS) scheme is a method to share a secret among a group of participants with different levels of authority. The authorized subsets of HTSS schemes are those satisfying a sequence of threshold requirements. In 2007, Tassa proposed an HTSS scheme based on Birkhoff interpolation. This scheme is not secure for sharing arbitrary number of secrets during a single sharing process. In this paper, we employ cellular automata to improve Tassa's approach and propose a hierarchical threshold multi-secret sharing scheme. We then prove the security of the proposed scheme.","PeriodicalId":376013,"journal":{"name":"2015 18th CSI International Symposium on Computer Architecture and Digital Systems (CADS)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128742319","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Impact of operand sharing to the processor energy efficiency 操作数共享对处理器能效的影响
Heikki O. Kultala, Joonas Multanen, P. Jaaskelainen, T. Viitanen, J. Takala
{"title":"Impact of operand sharing to the processor energy efficiency","authors":"Heikki O. Kultala, Joonas Multanen, P. Jaaskelainen, T. Viitanen, J. Takala","doi":"10.1109/CADS.2015.7377786","DOIUrl":"https://doi.org/10.1109/CADS.2015.7377786","url":null,"abstract":"Transport triggered architecture processors may have function unit input registers, which allow operands to be written to function units earlier than the clock cycle where the operation begins execution. An operand used in consecutive operations may be written only once, saving register file accesses and internal bus traffic. This optimization is called operand sharing. In this paper, the effectiveness of operand sharing is analyzed from the perspective of improving the energy-efficiency of the processor. On average of 12.0 % and at the best case of 32.4 % of register file reads could be eliminated, resulting in the best case power savings of 5.3% and energy savings of 8.8 %. In one of the 14 measured cases, operand sharing allowed a register file read port to be removed without performance penalty.","PeriodicalId":376013,"journal":{"name":"2015 18th CSI International Symposium on Computer Architecture and Digital Systems (CADS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131477978","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Coplanar QCA serial adder and multiplier via clock-zone based crossover 共面QCA串行加法器和乘法器,通过基于时钟带的交叉
Dariush Abedi, G. Jaberipur
{"title":"Coplanar QCA serial adder and multiplier via clock-zone based crossover","authors":"Dariush Abedi, G. Jaberipur","doi":"10.1109/CADS.2015.7377791","DOIUrl":"https://doi.org/10.1109/CADS.2015.7377791","url":null,"abstract":"The Quantum-dot Cellular Automata represents one of the newest technologies that is emerging as possible replacement for CMOS. In this paper, we design a QCA serial adder (QSA) that leads to less cell count and area at no delay penalty. The latest proposed layout for QCA full adders, which uses a coplanar clock-zone based crossover design, is employed here. We further explore the design of serial-parallel multipliers based on the proposed QSA. Evaluations are based on the QCA-specific cost function and conventional measures, where the simulation results indicate that our designs achieve remarkable improvement in comparison to the best previous relevant works. Verification and simulations are carried out by QCADesigner.","PeriodicalId":376013,"journal":{"name":"2015 18th CSI International Symposium on Computer Architecture and Digital Systems (CADS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116205627","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
Highly efficient alpha-beta pruning minimax based Loop Trax Solver on FPGA 基于FPGA的高效alpha-beta剪枝minimax循环轨迹求解器
Sajjad Mozaffari, Bardia Azizian, Mohammad H. Shadmehr
{"title":"Highly efficient alpha-beta pruning minimax based Loop Trax Solver on FPGA","authors":"Sajjad Mozaffari, Bardia Azizian, Mohammad H. Shadmehr","doi":"10.1109/CADS.2015.7377789","DOIUrl":"https://doi.org/10.1109/CADS.2015.7377789","url":null,"abstract":"This article presents our hardware architecture of an alpha-beta based hardware engine for Loop Trax board game presented in the 2nd National Digital System Design Contest of Iran. In our proposed architecture, we used minimax algorithm with a highly efficient alpha-beta pruning and hardware parallelization to speed up the most time-consuming tasks. We also included a technique called Path Based Memory, which causes sensible reduction of data storage and simplification of calculations. The results show that our design can run up to 50MHz on Altera DE2 platform and requires 27k LEs.","PeriodicalId":376013,"journal":{"name":"2015 18th CSI International Symposium on Computer Architecture and Digital Systems (CADS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128520294","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Heuristic metamorphic malware detection based on statistics of assembly instructions using classification algorithms 基于分类算法的汇编指令统计的启发式变形恶意软件检测
P. Khodamoradi, M. Fazlali, F. Mardukhi, M. Nosrati
{"title":"Heuristic metamorphic malware detection based on statistics of assembly instructions using classification algorithms","authors":"P. Khodamoradi, M. Fazlali, F. Mardukhi, M. Nosrati","doi":"10.1109/CADS.2015.7377792","DOIUrl":"https://doi.org/10.1109/CADS.2015.7377792","url":null,"abstract":"The competition between malware creators and those who work on malware detection, led to emergence and development of multifarious techniques for both creation and detection. In recent years, metamorphic malwares have become a serious challenge for antivirus programmers. Signature and heuristic based techniques cannot offer plenary solutions for detection of metamorphic malwares; because such those malwares can reconstruct from generation to generation without destruction in their functions. It caused difficulty in detecting them. In this research, we introduce a new technique for detecting the unknown malwares based on the counting the assembly instructions. Statistics which are obtained from analysis of different variables of a specific malware can be utilized as a signature. Also, accuracy, efficiency and fast performance must be considered as important issues. So far, lack of some of these features is seen in almost all the suggested methods. But, in the proposed method, speed is not a challenging issue, since the extraction of statistics from assembly codes is a very fast process. Experiments on several malwares and harmless programs indicated the excellence of this method rather than previous studies.","PeriodicalId":376013,"journal":{"name":"2015 18th CSI International Symposium on Computer Architecture and Digital Systems (CADS)","volume":"161 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122862911","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 35
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书