فیلترها/جستجو در نتایج    

فیلترها

سال

بانک‌ها




گروه تخصصی











متن کامل


نویسندگان: 

PARK CHANGGYOO | KIM SHIN GYU | HAN HYUCK

اطلاعات دوره: 
  • سال: 

    2010
  • دوره: 

    -
  • شماره: 

    -
  • صفحات: 

    1-4
تعامل: 
  • استنادات: 

    1
  • بازدید: 

    92
  • دانلود: 

    0
کلیدواژه: 
چکیده: 

شاخص‌های تعامل:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

بازدید 92

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesدانلود 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesاستناد 1 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesمرجع 0
نویسندگان: 

JAFARSALEHI M. | SALEHNAMADI M.REZA

اطلاعات دوره: 
  • سال: 

    2011
  • دوره: 

    2
  • شماره: 

    1
  • صفحات: 

    49-58
تعامل: 
  • استنادات: 

    0
  • بازدید: 

    303
  • دانلود: 

    0
چکیده: 

Today power consumption is considered to be one of the important issues. Therefore, its reduction plays a considerable role in developing systems. Previous studies have shown that approximately 50% of total power consumption is used in Cache memories. There is a direct relationship between power consumption and replacement quantity made in Cache. The less the number of replacements is, the less the power consumption is. In this paper, a mechanism was proposed a mechanism to reduce power consumption using full associative organization and layered replacement algorithm. In this scheme, all Cache blocks were divided into three layers. Final layer used FIFO replacement algorithm and middle layer used random replacement algorithm. Also first layer used LRU replacement algorithm. Simulation results were shown using tools written by VB language that in the proposed plan the number of replacement was less than 8-way associative using LRU replacement algorithm.

شاخص‌های تعامل:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

بازدید 303

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesدانلود 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesاستناد 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesمرجع 0
اطلاعات دوره: 
  • سال: 

    621
  • دوره: 

    20
  • شماره: 

    3
  • صفحات: 

    112-124
تعامل: 
  • استنادات: 

    0
  • بازدید: 

    15
  • دانلود: 

    0
چکیده: 

The overall performance of any integrated circuit is defined by its proper memory design, as it is a mandatory and major block which requires more area and power. The prime interest of this article is to design a memory structure which is tolerant to variations in CNFET (Carbon nanotube field effect transistor) parameters like pitch, diameter and number of CNT tubes, and also offer low power and high speed of operation. In this context, CNFET based stacked SRAM (Static random access memory) design is proposed to attain the above mentioned criteria. Concept of stack effect is utilized in the cross coupled inverter section of the memory structure to attain low power. The power, speed and energy analysis for the proposed structure is done, and compared with the conventional structures to justify the proposed memory cell performance. HSPICE simulation results has confirmed that the proposed structure offers about 34%, 54% and 95% power saving in hold mode, read mode and write mode respectively. In speed and energy point of view it provides about 97% read delay, 92% write delay and 98% energy savings than the conventional memory structures. These results make it clear that the proposed SRAM is suitable for the 5G networks where circuit speed, power and energy consumption are the major concern.

شاخص‌های تعامل:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

بازدید 15

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesدانلود 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesاستناد 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesمرجع 0
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources
اطلاعات دوره: 
  • سال: 

    2024
  • دوره: 

    20
  • شماره: 

    2
  • صفحات: 

    112-124
تعامل: 
  • استنادات: 

    0
  • بازدید: 

    22
  • دانلود: 

    0
چکیده: 

The overall performance of any integrated circuit is defined by its proper memory design, as it is a mandatory and major block which requires more area and power. The prime interest of this article is to design a memory structure which is tolerant to variations in CNFET (Carbon nanotube field effect transistor) parameters like pitch, diameter and number of CNT tubes, and also offer low power and high speed of operation. In this context, CNFET based stacked SRAM (Static random access memory) design is proposed to attain the above mentioned criteria. Concept of stack effect is utilized in the cross coupled inverter section of the memory structure to attain low power. The power, speed and energy analysis for the proposed structure is done, and compared with the conventional structures to justify the proposed memory cell performance. HSPICE simulation results has confirmed that the proposed structure offers about 34%, 54% and 95% power saving in hold mode, read mode and write mode respectively. In speed and energy point of view it provides about 97% read delay, 92% write delay and 98% energy savings than the conventional memory structures. These results make it clear that the proposed SRAM is suitable for the 5G networks where circuit speed, power and energy consumption are the major concern.

شاخص‌های تعامل:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

بازدید 22

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesدانلود 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesاستناد 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesمرجع 0
اطلاعات دوره: 
  • سال: 

    1385
  • دوره: 

    4
  • شماره: 

    3 (الف)
  • صفحات: 

    37-44
تعامل: 
  • استنادات: 

    0
  • بازدید: 

    837
  • دانلود: 

    0
چکیده: 

یکی از عوامل اصلی تعیین سرعت پردازنده های امروزی نرخ دسترسی آنها به حافظه می باشد. برای بالا بردن این نرخ از حافظه نهان استفاده می شود که سرعت را به مقدار قابل توجهی افزایش می دهد. ولی این سرعت نیز برای سیستم هایی که احتیاج به دسترسی موازی به حافظه دارند جوابگو نمی باشد. در این مقاله سعی شده است یک روش جدید با استفاده از خردکردن حافظه چند قست و دسترسی همزمان به آنها ارایه شود، که تسریع دسترسی به حافظه را به میزان قابل ملاحظه ای افزایش می دهد.

شاخص‌های تعامل:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

بازدید 837

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesدانلود 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesاستناد 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesمرجع 0
اطلاعات دوره: 
  • سال: 

    2019
  • دوره: 

    5
تعامل: 
  • بازدید: 

    139
  • دانلود: 

    0
چکیده: 

COMMUNITY STRUCTURE DETECTION IN SOCIAL NETWORKS HAS BECOME A BIG CHALLENGE. VARIOUS METHODS IN THE LITERATURE HAVE BEEN PRESENTED TO SOLVE THIS CHALLENGE. RECENTLY, SEVERAL METHODS HAVE ALSO BEEN PROPOSED TO SOLVE THIS CHALLENGE BASED ON A MAPPING-REDUCTION MODEL, IN WHICH DATA AND ALGORITHMS ARE DIVIDED BETWEEN DIFFERENT PROCESS NODES SO THAT THE COMPLEXITY OF TIME AND memory OF COMMUNITY DETECTION IN LARGE SOCIAL NETWORKS IS REDUCED. IN THIS PAPER, A MAPPING-REDUCTION MODEL IS FIRST PROPOSED TO DETECT THE STRUCTURE OF COMMUNITIES. THEN THE PROPOSED FRAMEWORK IS REWRITTEN ACCORDING TO A NEW MECHANISM CALLED DISTRIBUTED Cache memory; DISTRIBUTED Cache memory CAN STORE DIFFERENT VALUES ASSOCIATED WITH DIFFERENT KEYS AND, IF NECESSARY, PUT THEM AT DIFFERENT COMPUTATIONAL NODES. FINALLY, THE PROPOSED REWRITTEN FRAMEWORK HAS BEEN IMPLEMENTED USING SPARK TOOLS AND ITS IMPLEMENTATION RESULTS HAVE BEEN REPORTED ON SEVERAL MAJOR SOCIAL NETWORKS. THE PERFORMED EXPERIMENTS SHOW THE EFFECTIVENESS OF THE PROPOSED FRAMEWORK BY VARYING THE VALUES OF VARIOUS PARAMETERS.

شاخص‌های تعامل:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

بازدید 139

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesدانلود 0
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources
نویسندگان: 

Mollakazemiha Mahdi | Fathzadeh Hassan

اطلاعات دوره: 
  • سال: 

    1402
  • دوره: 

    17
  • شماره: 

    45
  • صفحات: 

    203-214
تعامل: 
  • استنادات: 

    0
  • بازدید: 

    154
  • دانلود: 

    37
چکیده: 

There are two approaches for simulating memory as well as learning in artificial intelligence; the functionalistic approach and the cognitive approach. The necessary condition to put the second approach into account is to provide a model of brain activity that contains a quite good congruence with observational facts such as mistakes and forgotten experiences. Given that human memory has a solid core that includes the components of our identity, our family and our hometown, the major and determinative events of our lives, and the countless repeated and accepted facts of our culture, the more we go to the peripheral spots the data becomes flimsier and more easily exposed to oblivion. It was essential to propose a model in which the topographical differences are quite distinguishable. In our proposed model, we have translated this topographical situation into quantities, which are attributed to the nodes. The result is an edge-weighted graph with mass-based values on the nodes which demonstrates the importance of each atomic proposition, as a truth, for an intelligent being. Furthermore, it dynamically develops and modifies, and in successive phases, it changes the mass of the nodes and weight of the edges depending on gathered inputs from the environment.

شاخص‌های تعامل:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

بازدید 154

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesدانلود 37 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesاستناد 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesمرجع 0
نویسندگان: 

ESFAHANI M. | SOLEIMANY H. | AREF M.R.

نشریه: 

Scientia Iranica

اطلاعات دوره: 
  • سال: 

    2022
  • دوره: 

    29
  • شماره: 

    4 (Transactions D: Computer Science and Engineering and Electrical Engineering)
  • صفحات: 

    1949-1956
تعامل: 
  • استنادات: 

    0
  • بازدید: 

    50
  • دانلود: 

    0
چکیده: 

CPU Caches are powerful sources of information leakage. To develop practical Cache-based attacks, the need for automation of the process of finding exploitable Cachebased side-channels in computer systems is felt more than ever. Cache template attack is a generic technique that utilizes Flush+Reload attack in order to automatically exploit Cache vulnerability of Intel platforms. Cache template attack on the T-table-based AES implementation consists of two phases including the pro , ling phase and key exploitation phase. Pro , ling is a preprocessing phase to monitor dependencies between the secret key and behavior of the Cache memory. In addition, the addresses of T-tables can be obtained automatically. At the key exploitation phase, Most Significant Bits (MSBs) of the secret key bytes are retrieved by monitoring the exploitable addresses. This study proposed a simple yet effective searching technique, which accelerates the pro , ling phase by a factor of utmost 64. In order to verify the theoretical model of our technique, the mentioned attack on AES was implemented. The experimental results revealed that the pro , ling phase runtime of the Cache template attack was approximately 10 minutes, while the proposed method could speed up the running of this phase up to almost 9 seconds.

شاخص‌های تعامل:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

بازدید 50

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesدانلود 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesاستناد 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesمرجع 0
نویسندگان: 

JEONG JAEHEON | DUBOIS MICHEL

اطلاعات دوره: 
  • سال: 

    2003
  • دوره: 

    -
  • شماره: 

    -
  • صفحات: 

    0-0
تعامل: 
  • استنادات: 

    1
  • بازدید: 

    122
  • دانلود: 

    0
کلیدواژه: 
چکیده: 

شاخص‌های تعامل:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

بازدید 122

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesدانلود 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesاستناد 1 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesمرجع 0
نویسندگان: 

مقصودلو محمد

اطلاعات دوره: 
  • سال: 

    1402
  • دوره: 

    12
  • شماره: 

    4
  • صفحات: 

    52-65
تعامل: 
  • استنادات: 

    0
  • بازدید: 

    17
  • دانلود: 

    0
چکیده: 

در این طرح، ساختاری بهبود یافته برای سیاست جایگزینی در حافظه نهان به منظور پیشگیری از وقوع آسیب پذیری های سالمندی ناشی از پروتکل های هماهنگی ارائه شده است. روش پیشنهادی بر اساس خروجی های یک مطالعه جامع بر روی دلایل وقوع کاهش حاشیه نویز ایستا سلول های حافظه ایستا با دسترسی تصادفی ارائه شده است. مطالعه جامع مذکور نشان می دهد که توزیع نامتوازن بلوک های داده با حالات هماهنگی متفاوت در بین خطوط حافظه نهان به عنوان یکی از دلایل وقوع کاهش حاشیه نویز در سلول های حافظه نهان به حساب می آید. بر اساس یافته ها، یک سیاست جایگزینی بهبود یافته برای حافظه نهان به منظور ایجاد توازن در توزیع بلوک های داده از نوع تمیز و کثیف بین خطوط مختلف حافظه ارائه شده است. در این راستا، سیاست جایگزینی شبه اخیراً کمتر استفاده شده بازطراحی شده است، به نحوی که در زمان خروج بلوک های داده، حالت هماهنگی بلوک ها و نوع بروز عدم برخورد ناشی از تناقض آدرس نیز لحاظ گردد. نتایج روش پیشنهادی نشان دهنده بهبودی حدود 10 و 11 درصدی میزان تنزل در روند کاهشی حاشیه نویز ایستا در زمان ذخیره سازی و در زمان خواندن در سلول های حافظه نهان می باشد. روش پیشنهادی منجر به سربار ناچیز مساحت و انرژی به همراه کمتر از یک درصد کاهش در نرخ برخورد حافظه نهان می گردد.

شاخص‌های تعامل:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

بازدید 17

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesدانلود 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesاستناد 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesمرجع 0
litScript
telegram sharing button
whatsapp sharing button
linkedin sharing button
twitter sharing button
email sharing button
email sharing button
email sharing button
sharethis sharing button