• 제목/요약/키워드: P-Parallel

검색결과 1,023건 처리시간 0.031초

Range Kernel Orthogonality and Finite Operators

  • Mecheri, Salah;Abdelatif, Toualbia
    • Kyungpook Mathematical Journal
    • /
    • 제55권1호
    • /
    • pp.63-71
    • /
    • 2015
  • Let H be a separable infinite dimensional complex Hilbert space, and let $\mathcal{L}(H)$ denote the algebra of all bounded linear operators on H into itself. Let $A,B{\in}\mathcal{L}(H)$ we define the generalized derivation ${\delta}_{A,B}:\mathcal{L}(H){\mapsto}\mathcal{L}(H)$ by ${\delta}_{A,B}(X)=AX-XB$, we note ${\delta}_{A,A}={\delta}_A$. If the inequality ${\parallel}T-(AX-XA){\parallel}{\geq}{\parallel}T{\parallel}$ holds for all $X{\in}\mathcal{L}(H)$ and for all $T{\in}ker{\delta}_A$, then we say that the range of ${\delta}_A$ is orthogonal to the kernel of ${\delta}_A$ in the sense of Birkhoff. The operator $A{\in}\mathcal{L}(H)$ is said to be finite [22] if ${\parallel}I-(AX-XA){\parallel}{\geq}1(*)$ for all $X{\in}\mathcal{L}(H)$, where I is the identity operator. The well-known inequality (*), due to J. P. Williams [22] is the starting point of the topic of commutator approximation (a topic which has its roots in quantum theory [23]). In [16], the author showed that a paranormal operator is finite. In this paper we present some new classes of finite operators containing the class of paranormal operators and we prove that the range of a generalized derivation is orthogonal to its kernel for a large class of operators containing the class of normal operators.

최소 자료 이동을 위한 최적 병렬 정렬 알고리즘 (An Optimal Parallel Sort Algorithm for Minimum Data Movement)

  • 홍성수;심재홍
    • 한국정보처리학회논문지
    • /
    • 제1권3호
    • /
    • pp.290-298
    • /
    • 1994
  • 본 논문은 p(p= $n^{1-x}$, 0〈x〈1)개 프로세서가 존재하는 EREW-PRAM 모델 병 렬 컴퓨터에서 시간 복잡도가 0( $n^{x}$ log n)이며 비용 (최악의 실행시간*프로세서 수)은 0(nlogn)이고, 자료 이동도가 0( $n^{1-}$x+ $n^{x}$ )인 병렬 정렬 알고리즘을 제안한다. 병렬 정렬 알고리즘은 리스트를 p개 특정키를 중심으로 분리한 다음 블럭 의 크기를 거의 일정하게 할 수 있는 엔코딩 기법을 사용했다.다.

  • PDF

SPAX 병렬 컴퓨터에서의 온라인 무간섭 네트워크 성능 감시기 (An on-line non-invasive network monitor for the SPAX parallel computer)

  • 이승구
    • 전자공학회논문지C
    • /
    • 제34C권6호
    • /
    • pp.44-50
    • /
    • 1997
  • This paper describes the design and test of an on-line non-invasive network performance monitor (hardware portion) for the SPAX parallel computer. The SPAX parallel computer supports up to 256 intel P6 processors with 4 P6 processors constituting a processign node. The nodes are interconnected with a dual two-level crossbar network calle dXcent-net. Since the performance of the SPAX parallel computer is highly dependent on the proper and efficient operation of the network, an on-line non-invasive network performance monitor (with hardware components) has been developed to aid in the monitoring and tunign of the Xcent-net. Successful testing of a prototype node monitor board and PC interface system shows that our monitor design provides a low-cost practical solution to this problem.

  • PDF

ERROR ANALYSIS OF THE hp-VERSION UNDER NUMERICAL INTEGRATIONS FOR NON-CONSTANT COEFFICIENTS

  • KIM, IK-SUNG
    • 호남수학학술지
    • /
    • 제27권2호
    • /
    • pp.317-332
    • /
    • 2005
  • In this paper we consider the hp-version to solve non-constant coefficients elliptic equations on a bounded, convex polygonal domain ${\Omega}$ in $R^2$. A family $G_p=\{I_m\}$ of numerical quadrature rules satisfying certain properties can be used for calculating the integrals. When the numerical quadrature rules $I_m{\in}G_p$ are used for computing the integrals in the stiffness matrix of the variational form we will give its variational form and derive an error estimate of ${\parallel}u-{\widetilde{u}}^h_p{\parallel}_{1,{\Omega}$.

  • PDF

Spin-polarized Current Switching of Co/Cu/Py Pac-man type II Spin-valve

  • Lyle, Andrew;Hong, Yang-Ki;Choi, Byoung-Chul;Abo, Gavin;Bae, Seok;Jalli, Jeevan;Lee, Jae-Jin;Park, Mun-Hyoun;Syslo, Ryan
    • Journal of Magnetics
    • /
    • 제15권3호
    • /
    • pp.103-107
    • /
    • 2010
  • We investigated spin-polarized current switching of Pac-man type II (PM-II) nanoelements in Pac-man shaped nanoscale spin-valves (Co/Cu/Py) using micromagnetic simulations. The effects of slot angle and antiferromagnetic (AFM) layer were simulated to obtain optimum switching in less than 2 ns. At a critical slot angle of $105^{\circ}$, the lowest current density for anti-parallel to parallel (AP-P) switching was observed due to no vortex or antivortex formation during the magnetic reversal process. All other slot angles for AP-P formed a vortex or antivortex during the magnetization reversal process. Additionally, a vortex or anti-vortex formed for all slot angles for parallel to anti-parallel (P-AP) switching. The addition of an AFM layer caused the current density to decrease significantly for AP-P and P-AP at slot angles less than $90^{\circ}$. However, at slot angles greater than $90^{\circ}$, the current density tended to decrease by less amounts or actually increased slightly as shape anisotropy became more dominant. This allowed ultra-fast switching with 5.05 and $5.65{\times}10^8\;A/cm^2$ current densities for AP-P and P-AP, respectively, at a slot angle of $105^{\circ}$.

Efficient Detection of Space-Time Block Codes Based on Parallel Detection

  • 김정창;전경훈
    • 한국통신학회논문지
    • /
    • 제36권2A호
    • /
    • pp.100-107
    • /
    • 2011
  • Algorithms based on the QR decomposition of the equivalent space-time channel matrix have been proved useful in the detection of V-BLAST systems. Especially, the parallel detection (PD) algorithm offers ML approaching performance up to 4 transmit antennas with reasonable complexity. We show that when directly applied to STBCs, the PD algorithm may suffer a rather significant SNR degradation over ML detection, especially at high SNRs. However, simply extending the PD algorithm to allow p ${\geq}$ 2 candidate layers, i.e. p-PD, regains almost all the loss but only at a significant increase in complexity. Here, we propose a simplification to the p-PD algorithm specific to STBCs without a corresponding sacrifice in performance. The proposed algorithm results in significant complexity reductions for moderate to high order modulations.

BERGMAN TYPE OPERATORS ON SOME GENERALIZED CARTAN-HARTOGS DOMAINS

  • He, Le;Tang, Yanyan;Tu, Zhenhan
    • 대한수학회지
    • /
    • 제58권6호
    • /
    • pp.1347-1365
    • /
    • 2021
  • For µ = (µ1, …, µt) (µj > 0), ξ = (z1, …, zt, w) ∈ ℂn1 × … × ℂnt × ℂm, define $${\Omega}({\mu},t)=\{{\xi}{\in}\mathbb{B}_{n_1}{\times}{\cdots}{\times}\mathbb{B}_{n_t}{\times}\mathbb{C}^m:{\parallel}w{\parallel}^2 where $\mathbb{B}_{n_j}$ is the unit ball in ℂnj (1 ≤ j ≤ t), C(χ, µ) is a constant only depending on χ = (n1, …, nt) and µ = (µ1, …, µt), which is a special type of generalized Cartan-Hartogs domain. We will give some sufficient and necessary conditions for the boundedness of some type of operators on Lp(Ω(µ, t), ω) (the weighted Lp space of Ω(µ, t) with weight ω, 1 < p < ∞). This result generalizes the works from certain classes of generalized complex ellipsoids to the generalized Cartan-Hartogs domain Ω(µ, t).

영역분할법과 유한요소해석을 이용한 유동장의 병렬계산 (Parallel Computation of a Flow Field Using FEM and Domain Decomposition Method)

  • 최형권;김범준;강성우;유정열
    • 대한기계학회:학술대회논문집
    • /
    • 대한기계학회 2002년도 학술대회지
    • /
    • pp.55-58
    • /
    • 2002
  • Parallel finite element code has been recently developed for the analysis of the incompressible Wavier-Stokes equations using domain decomposition method. Metis and MPI libraries are used for the domain partitioning of an unstructured mesh and the data communication between sub-domains, respectively. For unsteady computation of the incompressible Navier-Stokes equations, 4-step splitting method is combined with P1P1 finite element formulation. Smagorinsky and dynamic model are implemented for the simulation of turbulent flows. For the validation performance-estimation of the developed parallel code, three-dimensional Laplace equation has been solved. It has been found that the speed-up of 40 has been obtained from the present parallel code fir the bench mark problem. Lastly, the turbulent flows around the MIRA model and Tiburon model have been solved using 32 processors on IBM SMP cluster and unstructured mesh. The computed drag coefficient agrees better with the existing experiment as the mesh resolution of the region increases, where the variation of pressure is severe.

  • PDF