검색어 Computer Operation에 대한 글을 관련성을 기준으로 정렬하여 표시합니다. 날짜순 정렬 모든 글 표시
검색어 Computer Operation에 대한 글을 관련성을 기준으로 정렬하여 표시합니다. 날짜순 정렬 모든 글 표시

2017년 2월 23일 목요일

Computer-assisted surgery

Computer-assisted surgery

I let you do a surgical method to utilize ability for three-dimensional positioning, indication to have of the computer as a support resource at the time of an operation with the computer-assisted surgery (computer しえんげか, CAS: Computer Aided Surgery / Computer Assisted Surgery). An operation to utilize a neuronavigator and an operation support robot is the example. I show a current operation part on image data such as CT or the MRI that I imaged before art and perform the small operation that there is not with a robot in the human beings. It spread for the development of the personal computer rapidly from the 1990s.

Allied item

Outside link

This article is taken from the Japanese Wikipedia Computer-assisted surgery

This article is distributed by cc-by-sa or GFDL license in accordance with the provisions of Wikipedia.

Wikipedia and Tranpedia does not guarantee the accuracy of this document. See our disclaimer for more information.

In addition, Tranpedia is simply not responsible for any show is only by translating the writings of foreign licenses that are compatible with CC-BY-SA license information.

2016년 8월 17일 수요일

LINPACK

LINPACK

LINPACK
Author Jack Don Gullah, gym Bunty, クリーヴ モラー (English version), Gilbert Stewart
Programming language FORTRAN
Classification Library
Official site www.netlib.org/linpack/
I display a template

LINPACK (Linpack) is software library to perform a mathematical operation of the linear algebra on a computer.

Table of contents

Summary

Like MINPACK, EISPACK, I was developed as FORTRAN library in American Argonne Natl. Lab. It is really Jack Don Gullah, gym Bunty, クリーヴ モラー (English version), Gilbert Stewart to have developed. It was designed for super computers from the 1970s through the early 1980s [1] and was replaced [2], afterwards more refined library LAPACK.

LINPACK performs a vector operation and line operation using BLAS (Basic Linear Algebra Subprograms, basic linear algebra subprogram group) library.

It is a beginning that the LINPACK benchmark to mention later was shown as some User Manual of LINPACK.

Benchmark

LINPACK benchmarks
Author Jack Don Gullah, gym Bunty, クリーヴ モラー (English version), Gilbert Stewart
First edition 1979 (1979)
Official site www.netlib.org/benchmark/performance.ps
I display a template

The LINPACK benchmark evaluates the floating point arithmetic performance of the system by a benchmark program based on LINPACK. Jack Don Gullah devised it, and measures speed to remove linear equation system [3] Ax = b of general n X n in science, engineering. The latest edition of this benchmark is used for a ranking for a performance price of the world high-speed computer in TOP500 [4].

It is intended to get an approximate value of the performance that a computer solves a problem of the real world. However, it is impossible to let every performance of the computing system be representative with one measurements and is one simplification to the last. Still LINPACK benchmark provides good revision for the peak performance level that a maker provides. Peak performance is the most high efficiency that the computer can achieve theoretically, and it is calculated at clock frequency, number of the fetch cycle, 1 cycle of one second by the feasible operation number of times. Real performance is always lower than peak performance [5]. The performance of the computer is the complicated problem that various factors were connected with each other mutually. It is the practice number of times per one second of the 64 bits floating point arithmetic (it usually multiplies it by with the addition) to measure in LINPACK benchmark (FLOPS). However, it is more likely to lower than the most high efficiency when the performance when I carried out true application sets LINPACK benchmark appropriately and measured [6].

History

It is a beginning that the LINPACK benchmark was shown as an appendix of the User Manual of LINPACK in 1979 [7]. The time to take when I solved a problem using LINPACK package was designed for the purpose of giving you the clue which a user estimated. Therefore I prepared for 23 kinds of issue of line of size 100 at first. The size was chosen in consideration of memory capacity at the time. -I generate 10,000 floating point number within 1 from 1 at random, and several dense people in charge form a line. And I use the LU resolution by the partial pivot choice. I relaxed a limit and, with the size of the line as 300 and 1000, did it, and optimization by the hardware architecture that came to implement a line and the operation of the vector was made use of afterwards [8]. In the case of a problem of the size of order 1000, I call the benchmark LINPACK 1000 and can revise algorithm to solve a problem [5]. The benchmark which solved a problem of any size came up in 1991 [9]. I came to be provided, and TOP500 list came to be shown to the extreme performance of the super computer on a near value in this two years later.

Concrete benchmark

LINPACK 100

An original benchmark announced in User Manual [10] of LINPACK in 1979 is approximately near. I solve a problem in method of elimination of the gauss by the partial pivot choice and perform the floating point arithmetic of the 2/3n3 + 2n2 time. n is a degree of line A defining the problem with 100. Because size is small, and flexibility of the software was lacking, I cannot draw limit performance with many latest computers. However, I am helpful to some extent to estimate the performance of the calculation-centered user's program [5].

LINPACK 1000

Because I increased the size of the problem and assumed the degree of the line 1000 and I could change algorithm and did it, I became able to draw the performance that the limit of the computer was near. A point that the remaining limit does not lower relative precision and the operation number of times are points to be 2/3n3 + 2n2 time (n = 1000) [5].

HPLinpack

The conventional benchmark is not suitable for the performance measurement of the parallel computer [11]. Therefore new benchmark Linpack' s Highly Parallel Computing benchmark for parallel computers or HPLinpack benchmark was devised. A value to be able to draw the most high efficiency with the machine can make size n big in HPLinpack. The operation number of times is 2/3n3 + 2n2 time, but the algorithm is selectable. Because the algorithm of Strassen reduces the operation number of times, I am not usable [12]. It is necessary for the next ceremony to come to be managed as for the precision.

Here Precision, n of the はその machine the size [13] of the problem,line norm, It is は O- scale.

About each system, I report the next numerical value [5].

  • Rmax: Performance (GFLOPS) about the problem that is biggest with the machine
  • Nmax: Size of the biggest problem with the machine
  • Size of the problem when it becomes half performance of N1/2: Rmax
  • Rpeak: Theoretical peak performance (GFLOPS) of the machine

Using these results, a list of TOP500 is updated 2 times a year [4].

Implementation

I comment on the basic rule of the benchmark in the foregoing paragraph. The implementation of the program based on those rules varies, and there are implementation [14] by FORTRAN, implementation [15] by the C language, implementation [16] by the JAVA.

HPL

HPL implemented HPLinpack by C language, and it is originally a thing written as guidelines, but is used widely in TOP500. In addition, it does not have the problem to use technology and the package except HPL. HPL generates linear equation system of the n next and clears it up by the LU resolution by the partial pivot choice. With the need [17] that installs MPI and BLAS or VSIPL to use it.

If say roughly, there is the following characteristic in this algorithm [18]; [19].

  • I perform periodic data distribution by a two-dimensional block.
  • The LU resolution using kind of the right-looking method with the look-ahead of various depth
  • The recursive panel resolution
  • The panel broadcast has six kinds of methods.
  • Swap broadcast algorithm to reduce a bandwidth
  • Retreat substitution with the look-ahead of depth 1

Criticism

As for the factor that LINPACK benchmark succeeded, I include that the database which accumulated a fact that a comparison is easy, previous measurements exists [21] to generate a scalability [20] of HPLinpack, one numerical value. However, and I provided the performance level that only the programmer who gave optimization to LINPACK benchmark steadily from the release direct next could achieve and criticism that there was not a meaning was poured on the optimization only with the machine [22]. In addition, as for the problem solving, there is the criticism not to be the linear equation thing that pro-it, it represents the technology calculation whole of the dense coefficient line [23]. Only peak performance and the number of of the CPU the CPU's are emphasized, and the Jack Don Gullah who promoted LINPACK benchmark states that stress to a bandwidth and the network is not enough [24]. Tom ダニング of the Institute for U.S. national super computer application stated, "most all the members who were one of the interesting phenomena, and knew it laughed at it, and they understood the limit, but a kind of mind share produces it because we crossed it for several years, and we came using the value" about LINPACK benchmark [25]. , because "it is important that I clarify the performance of the system from various aspects," according to the Don Gullah, "the sponsor of TOP500 explores a method to expand the range of the benchmark positively" [20]. As a thing having high possibility about the expansion of the benchmark of TOP500 with the HPC challenge benchmark [26]. In addition, the unit called Traversed Edges Per Second (English version) (TEPS) which was a performance level of the Graph500 benchmark to depend on communication performance for more came to be used because the FLOPS value to evaluate in LINPACK had low contribution ratio of the communication performance.

The matter of time that the measurement requires

According to Jack Don Gullah, it is said that time comes to suffer from the measurement when I am going to get a good performance level in HPLinpack. In a meeting held in 2010, he performed expectation that it came to take two and a half days in the measurement within "several years" [27].

Footnote

  1. ^ Matlis, Jan (May 30, 2005). "Sidebar: The Linpack Benchmark". ComputerWorld. http://www.computerworld.com/s/article/102050/Sidebar_The_Linpack_Benchmark 
  2. ^ Markoff, John (September 22, 1991). "Technology; Measuring How Fast Computers Really Are". New York Times. http://select.nytimes.com/gst/abstract.html?res=F20616FF39550C718EDDA00894D9494D81 
  3. But a coefficient line dense ^. Generally, pro-a local low sparse line of the reference described by a connection list, the large-scale problem solved by law or a finite element method for a difference hardly receives the benefit of the cache memory. Therefore it is not necessarily a thing indicating the performance of the true application (in other words, performance is decided by memory band width.), and what think as one of the indexes will be proper.
  4. ^ a b "The Linpack Benchmark, TOP500 Supercomputing Sites." January 11, 2012 reading.
  5. ^ a b c d e Dongarra, Jack J.; Luszczek, Piotr; Petitet, Antoine (2003), "The LINPACK Benchmark: past, present and future," it is Concurrency and Computation: Practice and Experience (John Wiley & Sons, Ltd.): 803–820, http://www.netlib.org/utk/people/JackDongarra/PAPERS/hplpaper.pdf 
  6. ^ Jack Dongarra interview by Sander Olson, http://nextbigfuture.com/2010/06/jack-dongarra-interview-by-sander-olson.html 
  7. ^ Dongarra, J.J.; Moler, C.B.; Bunch, J.R.; Stewart, G.W. (1979), LINPACK: users' guide, SIAM, http://books.google.ch/books?id=AmSm1n3Vw0cC&lpg=PR5&ots=EDFdqJhr8x&dq=info%3Ahttp%3A%2F%2Fs3da3171290b34600.scholar.google.com%2F0&lr&pg=SL2-PA1#v=onepage&q&f=false 
  8. ^ Dongarra, Jack (1988), "The LINPACK benchmark: An explanation" Supercomputing (Springer Berlin/Heidelberg): 456–474, http://www.netlib.org/utk/people/JackDongarra/PAPERS/The-LINPACK-Benchmark-An-Explanation.pdf 
  9. ^ High Performance Linpack Benchmark, http://icl.cs.utk.edu/graphics/posters/files/SC2010-HPL.pdf January 10, 2012 reading. 
  10. ^ LINPACK users' manual
  11. ^ Bailey, D.H.; Barszcz, E.; Barton, J.T.; Browning, D.S.; Carter, R.L.; Dagum, L.; Fatoohi, R.A.; Frederickson, P.O. et al. (1991), The NAS parallel benchmarks summary and preliminary results, "Supercomputing '91 is Supercomputing: Proceedings of the 1991 ACM/IEEE Conference" 158–165, http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5348941&isnumber=5348846 
  12. ^ "LINPACK FAQ - Can I use Strassen' s Method when doing the matrix multiples in the HPL benchmark or for the Top500 run?." January 12, 2012 reading.
  13. ^ "LINPACK FAQ - To what accuracy must be the solution conform?." January 12, 2012 reading.
  14. ^ "Linpack benchmark program in Fortran". January 12, 2012 reading.
  15. ^ "Linpack benchmark program in C". January 12, 2012 reading.
  16. ^ "Linpack benchmark program in JAVA". January 12, 2012 reading.
  17. ^ "HPL - A Portable Implementation of the High-Performance Linpack Benchmark for Distributed-Memory Computers." January 12, 2012 reading.
  18. ^ "HPL algorithm." January 12, 2012 reading.
  19. ^ "HPL overview." January 12, 2012 reading.
  20. ^ a b Meuer, Martin (May 24, 2002). "An interview with supercomputer legend Jack Dongarra". January 13, 2012 reading.
  21. ^ Haigh, Thomas (2004), An interview with Jack J. Dongarra, http://history.siam.org/pdfs2/Dongarra_%20returned_SIAM_copy.pdf, "LINPACK is a benchmark that people often cite because there' s such a historical data base of information there, because it' s fairly easy to run, it' s fairly easy to understand, and it captures in some sense the best and worst of programming." 
  22. ^ Hammond, Steven (1995), Beyond Machoflops: Getting MPPs Into the Production Environment, http://nldr.library.ucar.edu/repository/collections/TECH-NOTE-000-000-000-227 
  23. ^ Gahvari, Hormozd; Hoemmen, Mark; Demmel, James; Yelick, Katherine (2006), "Benchmarking Sparse Matrix-Vector Multiply in Five Minutes," it is SPEC Benchmark Workshop, http://bebop.cs.berkeley.edu/pubs/gahvari2007-spmvbench-spec.pdf 
  24. ^ Dongarra, Jack J. (2007), "The HPC Challenge Benchmark: A Candidate for Replacing Linpack in the Top500?," it is SPEC Benchmark Workshop, http://www.spec.org/workshops/2007/austin/slides/Keynote_Jack_Dongarra.pdf 
  25. ^ Christopher Mims (November 8, 2010). "Why China's New Supercomputer Is Only Technically the World's Fastest". September 22, 2011 reading.
  26. ^ Luszczek, Piotr; Dongarra, Jack J.; Koester, David; Rabenseifner, Rolf; Lucas, Bob; Kepner, Jeremy; Mccalpin, John; Bailey, David et al. (2005), Introduction to the HPC Challenge Benchmark Suite, http://icl.cs.utk.edu/projectsfiles/hpcc/pubs/hpcc-challenge-benchmark05.pdf 
  27. ^ Dongarra, Jack J. (2010), "LINPACK Benchmark with Time Limits on Multicore & GPU Based Accelerators," it is http://www.netlib.org/utk/people/JackDongarra/SLIDES/isc-talk-06102.pdf 

Outside link

This article is taken from the Japanese Wikipedia LINPACK

This article is distributed by cc-by-sa or GFDL license in accordance with the provisions of Wikipedia.

Wikipedia and Tranpedia does not guarantee the accuracy of this document. See our disclaimer for more information.

In addition, Tranpedia is simply not responsible for any show is only by translating the writings of foreign licenses that are compatible with CC-BY-SA license information.

2017년 5월 7일 일요일

Network computer

Network computer

It is a trademark of the Oracle, and the network computer (British: network computer, NC) points to development, a disk reply desktop computer (or depending on a case set top box [1]) which I developed and the specifications as co-operation with Sun Microsystems and the ray corn computer until 1996 through 2000. The term "network computer" was spoken for marketing to let you recognize this design for a business use and general consumers (but concept itself is not a new thing).

Table of contents

Summary

It is kind of the thin client, but may be used as a thin client and a diskless desktop computer and synonym because there was some effectiveness of advertising.

Microsoft and Intel developed the standard NetPC which competed not to lose the share of their desktop computer market by NC because a CPU of Intel and software of Microsoft were not adopted for NC [2].

The NC brand supported the range of the desktop PC mainly, and cheapness and operation intended to ship it as an easy product than the PC which was the fat client that various suppliers were common by using a diskless design and cheap parts and software. However, the NC brand disappeared because the price of PC in itself fell, and the choices that I could use the PC for as diskless use, thin client, a hybrid client increased without showing the expanse that CEO Larry Ellison of the Oracle expected.

Cause of the failure

There are several factors that were not able to achieve at all the market size that Larry Ellison predicted. Primarily the price of PC becomes less than 1,000 dollars rapidly, and competition is the point that became very severe. Second the software for the NC did not mature and was not open [3].

Third some ideas led in the times. Those days (1996) when NC stood up, Internet connection of the standard home were dial-up connection of the 28.8kbit/s degree. It is insufficient to transfer an execute file with this communication performance. It is after 1998 that World Wide Web becomes mainstream. Internet service provider did not advertise it before it on a large scale (any place other than at least United States), and the knowledge about the Internet was limited, too. Therefore the NC was not accepted generally and was considered to be the device which was a simple niche.

As a result, most of NC were used as a simple cheap X terminal.

An NC standard and draft

According to Network Computer Reference Profile (NCRP) which was an original standard, it was prescribed that I supported the following to a minimum on hardware and software both sides to give NC.

First NCRP was devised in 1996, and Oracle, sun, IBM, apple, Netscape participated in development. An expansion standard includes the following things.

NC implementation

Acorn Network Computer
As reference implementation of the Oracle, a ray corn computer developed it.
NetProducts NetStation
A design by NChannel where "NetStation" is a British company and a trademark. NChannel was divided to two later and became Internet service provider called NetChannel and the apparatus production company called NetProducts. NetProducts was going to develop set top box TVemail specialized in next-generation product NetStation II and E-mail in cooperation with ray corn. However, NetProducts was settled in 1998 without being completed both.
Sun Microsystems JavaStation
Sun Microsystems developed JavaStation which was a kind of the NC using JavaOS and SPARC. It was a design similar to a work station of the company except that it was diskless.
IBM Network Station
IBM developed some NC apparatuses, too. Network Station boots it from AS/400 or the PC server which I connected NetBSD-based NCOS to by LAN. There is X server function at the same time to be local, and to be able to carry out the basic application such as Web browsers and functions as an X terminal. Actually, it was the form called the thing which a function was added to to an X terminal to some extent because there was little application. I used PowerPC at first, but changed it to Pentium of Intel with the model of last.

Allied item

Footnote

Outside link

This article is taken from the Japanese Wikipedia Network computer

This article is distributed by cc-by-sa or GFDL license in accordance with the provisions of Wikipedia.

Wikipedia and Tranpedia does not guarantee the accuracy of this document. See our disclaimer for more information.

In addition, Tranpedia is simply not responsible for any show is only by translating the writings of foreign licenses that are compatible with CC-BY-SA license information.

2016년 12월 18일 일요일

Super real baseball

Super real baseball

Super real baseball (SUPERREAL BASEBALL)

  1. A baseball game for Family Computer which bop released in -1988 year in "super real baseball '88." I speak it in this clause.
  2. The S! baseball game which SEGA (development: SEGA waw) delivers from July 2, 2004 for application.

Super real baseball '88
Genre Baseball game
Support model Family Computer
Origin of development パックスソフトニカ
Sales agency Bop
The number of people 1-2 people
The media ROM cartridge (2Mbit)
Sale date 1988July 30
I display a template

(SUPERREAL BASEBALL '88) is a baseball game of Family Computer released on July 30, 1988 by bop in super real baseball '88.

Table of contents

Summary

It is this product that it was done in a baseball game released at post-ファミスタ in the summer of 1988 when the very popular lingering sound of "the professional baseball family stadium" does not cool down by the companies is the most ambitious, making it.

Labeled as "the authorized game that professional baseball 12 baseball teams are interesting", it is the greatest characteristic that aimed at the differentiation with other baseball games by receiving permission in the Nippon Professional Baseball in particular, and having let a baseball team name, a player name appear in a real name with Family Computer for the first time. This was the element which was epoch-making for those days, and it was in this way the game that only Hankyu Braves and south seas Hawks appeared in a real name by successive consumer baseball games. In addition, it is the game that let the baseball stadium which exists by assuming Tokyo Dome which just opened the stage appear in a real name for the first time in those days (but other outdoor baseball stadiums do not come up and become the game in all game domed baseball stadiums). A hiragana letter, the foreign player are separated by katakana, and the Japanese player copes with the player of the names more than five characters.

As for this product, it was form of the vying with the baseball game of other companies of the release "the best play professional baseball" for the "ultimate tension drill stadium" and others same period so that there was it as above, and the advertisement that started a baseball game software name of other companies that "baseball, ファミスタ burnt and took good care of professional, exciting この four, and to wait." in two pages of spreads magnificently was started by a game magazine "family computer communication" magazine, and it was a topic. However, it was handling of the downgrading and did not reach the serialization such as other baseball games with "(review of "the boy jump") that was too much particular about reality, and misunderstood the pleasure of the baseball game" as a real evaluation most.

Game system

It is done in a feeling of operation of the game is ambitious, making it in pursuit of reality, but the frequent operation of the controller is demanded and, judging from a current standard, it is complicated and is difficult. For example, when it is necessary to push a motion start and the twice button of the release by the throw of the pitcher, and want to throw a breaking ball by adjusting the pitch of the ball with the time lag more; this; while have a short it, it is necessary to ring the cross key of the direction where want to bend it to repeatedly.

All the movement of the fielder becomes the manual manipulation in the defense. As for the defense screen, is mainstream from those days to the present; unique custom is necessary to look down, and to perform all it in the ground viewpoint from the catcher area not a viewpoint (e.g., as for the fried food ball, ball in itself passes out of sight, and often operate a fielder with the help of a shadow and the sound of the ball). Besides, I muff by 100% when I do not push the catching button with all catching opportunities including the throw from a friend fielder. Whenever a defense takes one out, the noisy sound such as the buzzer sounds. On the other hand, I hear no sound at the time of safe. A screen is replaced in the middle of a throw at the time of clearer safe.

The operation of the offense is not complicated as defense, but is it, but a pitcher one pitch of the bat of throwing it pose again, and the operation with the controller is necessary for the trifling act such as the lead of the runner. The element which was ahead of a current baseball game including the indication of the hitting point is founded in fact.

Other

Warren Cromartie (Yomiuri Giants) was image character and was used for a magazine advertisement and a box, but after that did not participate in a game until the end in a season because I received a pitch which hits the batter from Yasuo Kubo pitcher of Hanshin Tigers in June of this age, and real クロマティ broke it.

The beginning of announcement was reflected on a release plan and an advertisement on May 22, 1988, but repeats release postponement several times. For the reason why release was finally postponed on July 30, the same year, leading player, Richard Davis of Kintetsu Buffaloes arrest you for cannabis illegal possession in those days in June of the year, and discharge is decided, and it is a cause to have had to delete the data of the player. On the other hand, reproduction, more than expected ROM must produce the data which lengthened, and the batted ball was labelled than Tokyo Dome where I wanted to put the latest player data which played an active part after the start in a season in thought by the notice of the postponement by the magazine advertisement.

Shigesatou Itoi is in charge of the catch copy of the magazine advertisement ("it becomes くろまてが クロマティ"). By the advertisement placed in the game magazine, I placed the copy of contents different in each number in capital letters using the space of two-thirds page 1.

When I let a home run to the next base in runners without hitting the fried food, and doing a tag up during a one play, there is the bug that the progress of the game stops, and a game does not advance to. This thing is specified to a manual, and instructions are accomplished, in that case, to play a game in spite of reset again.

When Tamio Okuda of the unicorn wrote the column of the title, "I hate what with クソゲー" with a music magazine in about 1990, as a masterpiece of so-called クソゲー, I take up this product and "いっき" and explain game contents and operability. In addition, I purchased this product with two with Yoshiharu Abe who is the member of the unicorn in the same way there in Fukuoka, but all two of them reveal what only once plays from the height of the degree of difficulty.

Allied item

This article is taken from the Japanese Wikipedia Super real baseball

This article is distributed by cc-by-sa or GFDL license in accordance with the provisions of Wikipedia.

Wikipedia and Tranpedia does not guarantee the accuracy of this document. See our disclaimer for more information.

In addition, Tranpedia is simply not responsible for any show is only by translating the writings of foreign licenses that are compatible with CC-BY-SA license information.