Публикации

The article discusses the features of modern processor’s microarchitecture, the method of instruction’s and micro-operation’s accelerated execution. The research focuses on the organization of the decoding stage in the CPU core pipeline and Macro- and Micro-fusion algorithms. The Macro- and Micro-fusion mechanisms are defined. A computer simulator has been developed to explore these mechanisms. The developed software has a user-friendly interface, is easy to use, and combines training and research options. The computer simulator demonstrates the sequence of mechanism’s implementation; the resulting macro- or microoperations set after Macro- and Micro-fusion, and also reflects each algorithm features for different processor’s families. The software allows you to use either a pre-prepared file with Assembler (x86) code fragments as source data, or enter/change the source code fragments at your request. The main combinations of machine instructions that can be fused into a single macro-operation are considered, as well as instructions that can be decoded into fused microoperations. The simulator can be useful both for in Computer Science & Engineering students, especially for on-line education and for researchers and General-purpose CPU cores developers.

В статье приводится описание методики семантического анализа естественного языка (ЕЯ) и семантического поиска в нем, включающая в себя: основные этапы анализа ЕЯ, формат семантической сети для представления смысла текста, работа с полисемией (многозначностью) слов, семантико-синтаксическое согласование слов т.д. Методика основывается на применении объектно-атрибутного принципа организации вычислений и структур данных, относящемся к классу dataflow (вычислительные системы с управлением данными).

For analytically defined families of three-dimensional circulant networks with a parametric description, an analytical algorithm for finding shortest paths which has a common scheme for all networks of the family based on a given generating function was developed. A comparative analysis of three routing algorithms (analytical Two-terminal routing algorithm, Coefficients search on graph generators, and Dijkstra’s algorithm) for a variety of circulant networks from an analytically defined family was carried out. Estimates of the effectiveness of the considered routing algorithms for use in networks-on-chip were obtained.