1,720,954 research outputs found
Fuzzy logic arbiters for multiple-bus multiprocessor systems
No full textThis paper describes and evaluates the use of fuzzy logic arbiters for multiple-bus shared memory multiprocessor system. Multiple-bus systems allow multiple and simultaneous bus transfer in addition to a high degree of fault tolerance. In such systems, arbiters are used to resolve conflicts to system resources, which are the shared memory modules and the buses. Typically, these conflicts are resolved by using two-stage arbitration schemes that employ policies such as random choice, daisy chaining, round-robin, etc. A new way of implementing these arbiters is the use of fuzzy logic to resolve resource request conflicts based on the system state and performance variables. This paper describes a new technique for implementation of fuzzy logic in the system arbiters and presents a simulation program that evaluates the system performance. The program is coded in such a way as to accommodate any arbitration scheme, from which the fixed priority and fuzzy priority have been implemented. Parameters affecting multiple-bus system performance are considered and used as inputs to the fuzzy arbiters. The inputs are fuzzified by using appropriate membership functions, and rules have been defined in such a way as to increase and distribute evenly the acceptance probability of each processor in the system. Results from the simulation program using a prioritized arbitration scheme are compared against other published results and show very close agreement. Furthermore, results show an increase in the acceptance probability of the processors using fuzzy arbiters. © 2004 IEEE.BHUYAN LN, 1985, IEEE T COMPUT, V34, P279; HIROTA K, 1989, IEEE T SYST MAN CYB, V19, P980, DOI 10.1109-21.44013; HOLLIDAY MA, 1984, IEEET COMPUT C, V33, P76; HWANG K, 1985, COMPUTER ARCH PARALL; John LK, 1996, IEEE T COMPUT, V45, P580, DOI 10.1109-12.509909; Klir G., 1988, FUZZY SETS UNCERTAIN; LIU YC, 1989, J PARALLEL DISTR COM, V7, P321, DOI 10.1016-0743-7315(89)90023-3; MAHMUD SM, 1994, IEEE T COMPUT, V43, P789, DOI 10.1109-12.293258; MARSAN MA, 1983, IEEE T COMPUT, V32, P60; Mudge T. N., 1984, Proceedings of the 1984 International Conference on Parallel Processing (Cat. No. 84CH2045-3); Qiao WZ, 1996, FUZZY SET SYST, V78, P23; UCHINO E, 1993, FUZZY SET SYST, V59, P259, DOI 10.1016-0165-0114(93)90471-S; ZADEH LA, 1965, INFORM CONTROL, V8, P338, DOI 10.1016-S0019-9958(65)90241-X11
Mars cryptography on dynamic reconfigurable systems
No full textThis paper presents an emerging reconfigurable hardware that delivers flexible high performance for cryptographic algorithms. MorphoSys, a reconfigurable architecture that sustains implementations that can yield into equally or even better performance results than custom-hardware and yet preserves all the flexibility of general-purpose processors. With today's great demand for secure communications systems, networks and the Internet, there is a growing demand for real-time implementation of cryptographic algorithms. As a case study, this paper presents the mapping and performance analysis for one of the five AES finalists cryptographic algorithms: MARS. Being a complex and computationally demanding algorithm, it is well chosen to be mapped in order to test and evaluate on the MorphoSys dynamic reconfigurable computer (RC) system.*AES, AES TIM BEST KNOWN I; BURWICK C, 1999, IBM SUBMISSION AES; DAMAJ I, 2001, INT S INN INF COMM T, P249; Damaj I, 2001, ACS-IEEE INTERNATIONAL CONFERENCE ON COMPUTER SYSTEMS AND APPLICATIONS, PROCEEDINGS, P227; KAMALIZAD A, 2003, THESIS U CALIFORNIA; LEE M, 2000, J VLSI SIGN PROC SYS, P147; Majzoub S, 2003, ACS IEEE INT C COMP; Singh H, 2000, IEEE T COMPUT, V49, P465, DOI 10.1109-12.859540; WEAVER N, 2000, UC BERK REC ARCH SYS0
Mars cryptography on dynamic reconfigurable systems
No full textThis paper presents an emerging reconfigurable hardware that delivers flexible high performance for cryptographic algorithms. MorphoSys, a reconfigurable architecture that sustains implementations that can yield into equally or even better performance results than custom-hardware and yet preserves all the flexibility of general-purpose processors. With today's great demand for secure communications systems, networks and the Internet, there is a growing demand for real-time implementation of cryptographic algorithms. As a case study, this paper presents the mapping and performance analysis for one of the five AES finalists cryptographic algorithms: MARS. Being a complex and computationally demanding algorithm, it is well chosen to be mapped in order to test and evaluate on the MorphoSys dynamic reconfigurable computer (RC) system.*AES, AES TIM BEST KNOWN I; BURWICK C, 1999, IBM SUBMISSION AES; DAMAJ I, 2001, INT S INN INF COMM T, P249; Damaj I, 2001, ACS-IEEE INTERNATIONAL CONFERENCE ON COMPUTER SYSTEMS AND APPLICATIONS, PROCEEDINGS, P227; KAMALIZAD A, 2003, THESIS U CALIFORNIA; LEE M, 2000, J VLSI SIGN PROC SYS, P147; Majzoub S, 2003, ACS IEEE INT C COMP; Singh H, 2000, IEEE T COMPUT, V49, P465, DOI 10.1109-12.859540; WEAVER N, 2000, UC BERK REC ARCH SYS0
Performance evaluation of IPV6 routing on RC systems
No full textResearch in reconfigurable computing is becoming more pronounced with the increasing research effort being invested in this area. By placing the computationally intense portions of an application onto the reconfigurable hardware, that application can be greatly accelerated. Reconfigurable computers offer a compromise between the performance advantages of fixed-functionality hardware and the flexibility of software-programmable substrates. This paper presents a mapping of router as well as host routing algorithms pertaining to the IPv6 protocol on the MorphoSys, a reconfigurable system that has 64 processing cells potentially operating in parallel. Results proved that Morphosys achieves higher performance by 2 to 4-fold than some available routers.BAGHERZADEH N, 2000, J VLSI SIGNAL PROCES; Barat F, 2000, P IEEE RAP SYST PROT, P168, DOI 10.1109-IWRSP.2000.855217; *CISC SYST INC, 2001, DATA SHEET; Compton K, 2002, ACM COMPUT SURV, V34, P171, DOI 10.1145-508352.508353; Diab H, 2003, ACS IEEE INT C COMP; GULATI S, 2000, ACM CROSSROADS S AUG; *INT CORP, 2001, DAT SHEET; Thomas S. A., 1996, IPNG TCP IP PROTOCOL; WANG J, 2001, HIGH PERFORMANCE IP0
Performance evaluation of IPV6 routing on RC systems
No full textResearch in reconfigurable computing is becoming more pronounced with the increasing research effort being invested in this area. By placing the computationally intense portions of an application onto the reconfigurable hardware, that application can be greatly accelerated. Reconfigurable computers offer a compromise between the performance advantages of fixed-functionality hardware and the flexibility of software-programmable substrates. This paper presents a mapping of router as well as host routing algorithms pertaining to the IPv6 protocol on the MorphoSys, a reconfigurable system that has 64 processing cells potentially operating in parallel. Results proved that Morphosys achieves higher performance by 2 to 4-fold than some available routers.BAGHERZADEH N, 2000, J VLSI SIGNAL PROCES; Barat F, 2000, P IEEE RAP SYST PROT, P168, DOI 10.1109-IWRSP.2000.855217; *CISC SYST INC, 2001, DATA SHEET; Compton K, 2002, ACM COMPUT SURV, V34, P171, DOI 10.1145-508352.508353; Diab H, 2003, ACS IEEE INT C COMP; GULATI S, 2000, ACM CROSSROADS S AUG; *INT CORP, 2001, DAT SHEET; Thomas S. A., 1996, IPNG TCP IP PROTOCOL; WANG J, 2001, HIGH PERFORMANCE IP0
Defuzzification methods and new techniques for fuzzy controllers
No full textBased on the various components involved in the structure of fuzzy logic controllers, this study provides an in-depth examination of the different features and disadvantages of commonly used defuzzification methods. Then based on this examination, and taking into account the compatible assignment of the logical connectives, inference rules as well as membership functions (MFs), a superior defuzzification technique is described and justified. It is shown that this technique integrates the defuzzification problem into the global structure of fuzzy controllers. It also helps the designer achieve his design objectives in a simple and systematic manner. Another defuzzification strategy, which falls within the general framework of this study, is also given and commented upon. It is shown that this strategy satisfies properties which should be possessed by a desired defuzzification method, and also shares important features with the former one. Further, a recent defuzzification-based methodology for the systematic data-driven design of fuzzy controllers is outlined.
Going Beyond Counting First Authors in Author Co-citation Analysis
Full text linkThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Variations on the Author
Full text link“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Appropriate Similarity Measures for Author Cocitation Analysis
Full text linkWe provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
- …
