Pub Date : 2014-12-01DOI: 10.1109/ICHPCA.2014.7045347
R. Roul, S. Asthana, S. Sahay
With the rising quantity of textual data available in electronic format, the need to organize it become a highly challenging task. In the present paper, we explore a document organization framework that exploits an intelligent hierarchical clustering algorithm to generate an index over a set of documents. The framework has been designed to be scalable and accurate even with large corpora. The advantage of the proposed algorithm lies in the need for minimal inputs, with much of the hierarchy attributes being decided in an automated manner using statistical methods. The use of topic modeling in a pre-processing stage ensures robustness to a range of variations in the input data. For experimental work 20-Newsgroups dataset has been used. The F-measure of the proposed approach has been compared with the traditional K-Means and K-Medoids clustering algorithms. Test results demonstrate the applicability, efficiency and effectiveness of our proposed approach. After extensive experimentation, we conclude that the framework shows promise for further research and specialized commercial applications.
{"title":"Automated document indexing via intelligent hierarchical clustering: A novel approach","authors":"R. Roul, S. Asthana, S. Sahay","doi":"10.1109/ICHPCA.2014.7045347","DOIUrl":"https://doi.org/10.1109/ICHPCA.2014.7045347","url":null,"abstract":"With the rising quantity of textual data available in electronic format, the need to organize it become a highly challenging task. In the present paper, we explore a document organization framework that exploits an intelligent hierarchical clustering algorithm to generate an index over a set of documents. The framework has been designed to be scalable and accurate even with large corpora. The advantage of the proposed algorithm lies in the need for minimal inputs, with much of the hierarchy attributes being decided in an automated manner using statistical methods. The use of topic modeling in a pre-processing stage ensures robustness to a range of variations in the input data. For experimental work 20-Newsgroups dataset has been used. The F-measure of the proposed approach has been compared with the traditional K-Means and K-Medoids clustering algorithms. Test results demonstrate the applicability, efficiency and effectiveness of our proposed approach. After extensive experimentation, we conclude that the framework shows promise for further research and specialized commercial applications.","PeriodicalId":197528,"journal":{"name":"2014 International Conference on High Performance Computing and Applications (ICHPCA)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127086679","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}
Pub Date : 2014-12-01DOI: 10.1109/ICHPCA.2014.7045371
M. Padma Lalitha, Mieee A I T S-Rajampeta, India, P. Harshavardhan, Reddy P Janardhana, Naidu A, S-Raj T Ampeta
This paper presents the generation adequacy evaluation of a power system with high wind energy penetration. First, the wind turbine generator unit models are developed by considering the component failure rates and uncertain nature of wind energy. The Data Synthesizer Software is used to extract the hourly wind speed values from the average seasonal data. The Fuzzy C-means Clustering Method is used to obtain the required number of generation states from the hourly data. Then the Markov process is used to obtain the probability of each generation state. Then, these wind energy models are added to the Roy Billinton Test System (RBTS) by Recursive Algorithm approach and different reliability indices are calculated.
{"title":"Generation reliability evaluation of wind energy penetrated power system","authors":"M. Padma Lalitha, Mieee A I T S-Rajampeta, India, P. Harshavardhan, Reddy P Janardhana, Naidu A, S-Raj T Ampeta","doi":"10.1109/ICHPCA.2014.7045371","DOIUrl":"https://doi.org/10.1109/ICHPCA.2014.7045371","url":null,"abstract":"This paper presents the generation adequacy evaluation of a power system with high wind energy penetration. First, the wind turbine generator unit models are developed by considering the component failure rates and uncertain nature of wind energy. The Data Synthesizer Software is used to extract the hourly wind speed values from the average seasonal data. The Fuzzy C-means Clustering Method is used to obtain the required number of generation states from the hourly data. Then the Markov process is used to obtain the probability of each generation state. Then, these wind energy models are added to the Roy Billinton Test System (RBTS) by Recursive Algorithm approach and different reliability indices are calculated.","PeriodicalId":197528,"journal":{"name":"2014 International Conference on High Performance Computing and Applications (ICHPCA)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129243112","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}
Pub Date : 2014-12-01DOI: 10.1109/ICHPCA.2014.7045332
Lavanya Pamulaparty, C. V. Rao, M. S. Rao
In comparison to human searchers, crawlers are capable of retrieving data in greater depth and more quickly. As a result, it can face crippling impact on the performance of the site. Inessential to say, if a particular crawler is carrying out numerous requests per second and/or, Therefore, in a scenario involving multiple crawlers, it would be difficult for a server to handle requests in case each crawler downloads large files and/or performs numerous requests/second. So to avoid the overloading in the retrieving data in the proposed system a sequence flow protocol(Leakey Bucket) is which retrieves the data in the sequence order and also proposed mobbing unrestricted router (MUR)(CFR) which maintains three phases inbound, peak and outbound. If the inbound flow is less than the peak it allows the crawling, and at the same time if the inbound is greater than or equal to height the MUR protocol stops the crawling and request for the server to extend network resource. Is used for retrieving the data in sequential order.
{"title":"A novel approach for avoiding overload in the web crawling","authors":"Lavanya Pamulaparty, C. V. Rao, M. S. Rao","doi":"10.1109/ICHPCA.2014.7045332","DOIUrl":"https://doi.org/10.1109/ICHPCA.2014.7045332","url":null,"abstract":"In comparison to human searchers, crawlers are capable of retrieving data in greater depth and more quickly. As a result, it can face crippling impact on the performance of the site. Inessential to say, if a particular crawler is carrying out numerous requests per second and/or, Therefore, in a scenario involving multiple crawlers, it would be difficult for a server to handle requests in case each crawler downloads large files and/or performs numerous requests/second. So to avoid the overloading in the retrieving data in the proposed system a sequence flow protocol(Leakey Bucket) is which retrieves the data in the sequence order and also proposed mobbing unrestricted router (MUR)(CFR) which maintains three phases inbound, peak and outbound. If the inbound flow is less than the peak it allows the crawling, and at the same time if the inbound is greater than or equal to height the MUR protocol stops the crawling and request for the server to extend network resource. Is used for retrieving the data in sequential order.","PeriodicalId":197528,"journal":{"name":"2014 International Conference on High Performance Computing and Applications (ICHPCA)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126330777","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}
Pub Date : 2014-12-01DOI: 10.1109/ICHPCA.2014.7045291
Somak R. Das, Sowvik Dey
Cache memories can work as buffer between processors and main memories. It enables rapid access of data for a processor in operation. Set-associativity provides optimality in mapping of cache memories and reduction of cache miss probability. Design of a high speed cache has always been a desirable criteria of hardware experts as it increases processor utilization. Exploiting fault tolerance within such a cache memory of higher throughput ensures reliable data transfer and is an open research problem in the domain of high-performance computing. This paper proposes a design of low-order interleaved set-associative cache memory with lesser response time and exploits a high degree of fault tolerance.
{"title":"Exploiting fault tolerance within cache memory structures","authors":"Somak R. Das, Sowvik Dey","doi":"10.1109/ICHPCA.2014.7045291","DOIUrl":"https://doi.org/10.1109/ICHPCA.2014.7045291","url":null,"abstract":"Cache memories can work as buffer between processors and main memories. It enables rapid access of data for a processor in operation. Set-associativity provides optimality in mapping of cache memories and reduction of cache miss probability. Design of a high speed cache has always been a desirable criteria of hardware experts as it increases processor utilization. Exploiting fault tolerance within such a cache memory of higher throughput ensures reliable data transfer and is an open research problem in the domain of high-performance computing. This paper proposes a design of low-order interleaved set-associative cache memory with lesser response time and exploits a high degree of fault tolerance.","PeriodicalId":197528,"journal":{"name":"2014 International Conference on High Performance Computing and Applications (ICHPCA)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125629943","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}
Pub Date : 2014-12-01DOI: 10.1109/ICHPCA.2014.7045345
Soumen Roy, Utpal Roy, D. Sinha
Some common words (name, address, E-mail ID, ...), we press daily and we are habituated to press it in same rhythm, which is unique and can be used to segregate and distinguish people. In this paper we are considering rhythm not only the entered common words or some sequence of common characters. Here machine intelligence relies on the fact that it stores the typing style of some daily used words which are supported by the user and can be used as a secret key. Recognising typing style promises a parameter like behavioural biometric characteristics that may facilitate non-intrusive, cost-effective and continuous monitoring. But this technique, as of now, suffers from accuracy level and performance. In order to realize, this technique in practice a higher level of security and performance together with low cost version is needed with an error to an accepted level. Hence, it is highly essential to identify the controlling parameters and optimise the accuracy and performance as well as cost with new algorithms.
{"title":"Free-text user authentication technique through Keystroke Dynamics","authors":"Soumen Roy, Utpal Roy, D. Sinha","doi":"10.1109/ICHPCA.2014.7045345","DOIUrl":"https://doi.org/10.1109/ICHPCA.2014.7045345","url":null,"abstract":"Some common words (name, address, E-mail ID, ...), we press daily and we are habituated to press it in same rhythm, which is unique and can be used to segregate and distinguish people. In this paper we are considering rhythm not only the entered common words or some sequence of common characters. Here machine intelligence relies on the fact that it stores the typing style of some daily used words which are supported by the user and can be used as a secret key. Recognising typing style promises a parameter like behavioural biometric characteristics that may facilitate non-intrusive, cost-effective and continuous monitoring. But this technique, as of now, suffers from accuracy level and performance. In order to realize, this technique in practice a higher level of security and performance together with low cost version is needed with an error to an accepted level. Hence, it is highly essential to identify the controlling parameters and optimise the accuracy and performance as well as cost with new algorithms.","PeriodicalId":197528,"journal":{"name":"2014 International Conference on High Performance Computing and Applications (ICHPCA)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125751446","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}
Pub Date : 2014-12-01DOI: 10.1109/ICHPCA.2014.7045355
A. Aditya, S. Basu, Saurav Khandelwal, Saradindu Panda, Chiradeep Mukherjee, B. Maji
The literature of power device must aware of the fact of proper tradeoff between the choice of semiconductor material and the proper oxide along with it. With the growing semiconductor technology, the traditional semiconductor now has the promising competitors like silicon carbide and gallium nitride.The simulation considers the calculation of minimum potential at the center plane of the FinFET channel through which roll-off of threshold voltage is measured. The analysis proves gallium nitride and silicon carbide as the most promising material for FinFET manufacturing industries. The drain to source voltage along with fin-height, fin thickness and channel length are varied keeping other parameters constant. The purpose of this work is to find out the “other than silicon” material in solid state device technology.
{"title":"Threshold voltage roll-off for triple gate FinFET analysis based on several semiconductors used as substrate","authors":"A. Aditya, S. Basu, Saurav Khandelwal, Saradindu Panda, Chiradeep Mukherjee, B. Maji","doi":"10.1109/ICHPCA.2014.7045355","DOIUrl":"https://doi.org/10.1109/ICHPCA.2014.7045355","url":null,"abstract":"The literature of power device must aware of the fact of proper tradeoff between the choice of semiconductor material and the proper oxide along with it. With the growing semiconductor technology, the traditional semiconductor now has the promising competitors like silicon carbide and gallium nitride.The simulation considers the calculation of minimum potential at the center plane of the FinFET channel through which roll-off of threshold voltage is measured. The analysis proves gallium nitride and silicon carbide as the most promising material for FinFET manufacturing industries. The drain to source voltage along with fin-height, fin thickness and channel length are varied keeping other parameters constant. The purpose of this work is to find out the “other than silicon” material in solid state device technology.","PeriodicalId":197528,"journal":{"name":"2014 International Conference on High Performance Computing and Applications (ICHPCA)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132052809","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}
Pub Date : 2014-12-01DOI: 10.1109/ICHPCA.2014.7045330
Dipayan Dev, Ripon Patgiri
Size of the data used in today's enterprises has been growing at exponential rates from last few years. Simultaneously, the need to process and analyze the large volumes of data has also increased. To handle and for analysis of large datasets, an open-source implementation of Apache framework, Hadoop is used now-a-days. For managing and storing of all the resources across its cluster, Hadoop possesses a distributed file system called Hadoop Distributed File System(HDFS).HDFS is written completely in Java and is depicted in such a way that in can store Big Data more reliably, and can stream those at high processing time to the user applications. In recent days, Hadoop is used widely by popular organizations like Yahoo, Facebook and various online shopping market venders. On the other hand, Experiments on Data- Intensive computations are going on to parallelize the processing of data. None of them could actually achieve a desirable performance. Hadoop, with its Map-Reduce parallel data processing capability can achieve these goals efficiently [1]. This paper initially provides an overview of the HDFS in details. Later on, the paper reports the experimental work of Hadoop with the big data and suggests the various factors that affects the Hadoop cluster performance. Paper concludes with providing the different real field challenges of Hadoop in recent days and scope for future work.
{"title":"Performance evaluation of HDFS in big data management","authors":"Dipayan Dev, Ripon Patgiri","doi":"10.1109/ICHPCA.2014.7045330","DOIUrl":"https://doi.org/10.1109/ICHPCA.2014.7045330","url":null,"abstract":"Size of the data used in today's enterprises has been growing at exponential rates from last few years. Simultaneously, the need to process and analyze the large volumes of data has also increased. To handle and for analysis of large datasets, an open-source implementation of Apache framework, Hadoop is used now-a-days. For managing and storing of all the resources across its cluster, Hadoop possesses a distributed file system called Hadoop Distributed File System(HDFS).HDFS is written completely in Java and is depicted in such a way that in can store Big Data more reliably, and can stream those at high processing time to the user applications. In recent days, Hadoop is used widely by popular organizations like Yahoo, Facebook and various online shopping market venders. On the other hand, Experiments on Data- Intensive computations are going on to parallelize the processing of data. None of them could actually achieve a desirable performance. Hadoop, with its Map-Reduce parallel data processing capability can achieve these goals efficiently [1]. This paper initially provides an overview of the HDFS in details. Later on, the paper reports the experimental work of Hadoop with the big data and suggests the various factors that affects the Hadoop cluster performance. Paper concludes with providing the different real field challenges of Hadoop in recent days and scope for future work.","PeriodicalId":197528,"journal":{"name":"2014 International Conference on High Performance Computing and Applications (ICHPCA)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132546611","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}
Pub Date : 2014-12-01DOI: 10.1109/ICHPCA.2014.7045374
P. M. Pradhan, Chun Hing Cheng, J. R. Mitchell
Image texture is often characterized using gray level co-occurrence matrices (GLCM). The GLCM statistics reflect only the highest power and spatial frequencies. To address this, researchers have employed discrete wavelet transform (DWT) along with GLCM. However, this method involves a computationally complex convolution operation in the spatial domain, and also inherits the sampling limitations of the DWT. Extending texture analysis to the space-frequency (SF) domain will uncover patterns not visible through the GLCM-based approaches while still capitalizing on the effectiveness of the traditional co-occurrence matrix. The discrete S-transform (DST) provides the SF representation at a pixel by localizing with a Gaussian modulated sinusoidal window. The DST based texture analysis is proposed to improve upon the GLCM while providing advantages over wavelets. This paper presents the promising preliminary results achieved using the proposed method.
{"title":"S-transform based approach for texture analysis of medical images","authors":"P. M. Pradhan, Chun Hing Cheng, J. R. Mitchell","doi":"10.1109/ICHPCA.2014.7045374","DOIUrl":"https://doi.org/10.1109/ICHPCA.2014.7045374","url":null,"abstract":"Image texture is often characterized using gray level co-occurrence matrices (GLCM). The GLCM statistics reflect only the highest power and spatial frequencies. To address this, researchers have employed discrete wavelet transform (DWT) along with GLCM. However, this method involves a computationally complex convolution operation in the spatial domain, and also inherits the sampling limitations of the DWT. Extending texture analysis to the space-frequency (SF) domain will uncover patterns not visible through the GLCM-based approaches while still capitalizing on the effectiveness of the traditional co-occurrence matrix. The discrete S-transform (DST) provides the SF representation at a pixel by localizing with a Gaussian modulated sinusoidal window. The DST based texture analysis is proposed to improve upon the GLCM while providing advantages over wavelets. This paper presents the promising preliminary results achieved using the proposed method.","PeriodicalId":197528,"journal":{"name":"2014 International Conference on High Performance Computing and Applications (ICHPCA)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130827240","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}
Pub Date : 2014-12-01DOI: 10.1109/ICHPCA.2014.7045303
A. Chaudhary, Satvik Sachdev, Tribikram Pradhan, Santosh Kamath
Generally Cooperative communication means network communication where nodes assist instead of contend to transmit data for themselves and other. Recently, there has been increasing interest in integrating multi-hop relaying functionalities into MANET. Multi-hop wireless networks can potentially enhance coverage, data rates. In this paper, we studied multi-hop cooperative communication and proposed a new multi hop cooperative protocol for dynamic traffic pattern. And we have compared the performance with selective relaying in MANET with dynamic traffic pattern using network simulator NS2.34. Throughput and packet delivery ratio are used as performance metrics for contrast. We are comparing the performance when the size of the packet changes, when the time interval between the packets are changed, when mobility of nodes changes.
{"title":"Improving performance of MANET via cooperative communication with selective cooperation method considering dynamic traffic pattern using NS2","authors":"A. Chaudhary, Satvik Sachdev, Tribikram Pradhan, Santosh Kamath","doi":"10.1109/ICHPCA.2014.7045303","DOIUrl":"https://doi.org/10.1109/ICHPCA.2014.7045303","url":null,"abstract":"Generally Cooperative communication means network communication where nodes assist instead of contend to transmit data for themselves and other. Recently, there has been increasing interest in integrating multi-hop relaying functionalities into MANET. Multi-hop wireless networks can potentially enhance coverage, data rates. In this paper, we studied multi-hop cooperative communication and proposed a new multi hop cooperative protocol for dynamic traffic pattern. And we have compared the performance with selective relaying in MANET with dynamic traffic pattern using network simulator NS2.34. Throughput and packet delivery ratio are used as performance metrics for contrast. We are comparing the performance when the size of the packet changes, when the time interval between the packets are changed, when mobility of nodes changes.","PeriodicalId":197528,"journal":{"name":"2014 International Conference on High Performance Computing and Applications (ICHPCA)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133025624","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}
Pub Date : 2014-12-01DOI: 10.1109/ICHPCA.2014.7045292
S. Subha
All cache ways in w-way set associative cache are enabled during operation. This paper proposes an architecture to enable the occupied ways of w-way set associative cache. A variable set cache architecture is assumed. The proposed model introduces sequential component in cache circuit to enable the selected ways. The ways are put in off mode initially. The proposed model is simulated with SPEC2K benchmarks. The proposed model shows average power saving of 6.7% for level one cache of 2048 sets with associativities 8, 16, 32, level two cache size of 4096 sets with associativities 16, 32, 64 respectively in two level inclusive cache. The proposed model shows average power improvement of 4.7% for level one cache of 4096 sets with associativities 8, 16, 32, level two cache of 8192 sets with associativities of 16, 32, 64 respectively. The average memory access time is comparable in all configurations with the traditional model.
{"title":"A reconfigurable cache architecture","authors":"S. Subha","doi":"10.1109/ICHPCA.2014.7045292","DOIUrl":"https://doi.org/10.1109/ICHPCA.2014.7045292","url":null,"abstract":"All cache ways in w-way set associative cache are enabled during operation. This paper proposes an architecture to enable the occupied ways of w-way set associative cache. A variable set cache architecture is assumed. The proposed model introduces sequential component in cache circuit to enable the selected ways. The ways are put in off mode initially. The proposed model is simulated with SPEC2K benchmarks. The proposed model shows average power saving of 6.7% for level one cache of 2048 sets with associativities 8, 16, 32, level two cache size of 4096 sets with associativities 16, 32, 64 respectively in two level inclusive cache. The proposed model shows average power improvement of 4.7% for level one cache of 4096 sets with associativities 8, 16, 32, level two cache of 8192 sets with associativities of 16, 32, 64 respectively. The average memory access time is comparable in all configurations with the traditional model.","PeriodicalId":197528,"journal":{"name":"2014 International Conference on High Performance Computing and Applications (ICHPCA)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131272783","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：