New achievement: TSP chip structure can run 1 million billion operations per second
Startup Groq has just announced an amazing achievement, the chip using their TSP architecture can perform up to 1 peta task in a second, ie 1,000,000,000,000,000 tasks in a second. You may not know, Groq is the startup behind the Tensor Streaming Processor (TSP) technology - the chip structure is also a new way of performing calculations.
With the TSP chip structure, Groq was the first to reach this impressive figure.
Jonathan Ross, co-founder and CEO of Groq, said this was good news for both chip makers and customers.
Groq engineers put software optimization to the forefront, so Groq's TSP architecture is superior to current CPU and GPU structures, achieving both flexibility and flexibility in parallel. more actions.
It is important that all machine learning models (both old and new), can take advantage of the processing power of the TSP structure.
The purpose of designing this chip structure of Groq is to provide an ideal solution for machine learning processing process and related AI research fields.
Groq's chip structure manager Dennis Abts further emphasized that Groq's solution is also designed to perform the tasks of many other simple, high-performance industries. The TSP structure is suitable for all tasks related to data processing or calculation.
- Successful fabrication of an ultra-thin and flexible screen that can be glued on skin
- Sycamore, Google's quantum supercomputer only takes 2 seconds to mine the remaining 3 million Bitcoin?
You should read it
- Structure (Struct) in C #
- What is Silo Structure? Advantages and disadvantages of silos and effective alternatives
- Queue data structure (Queue)
- Stack data structure (Stack)
- Data structure in C / C ++
- Decode the meaning of Intel processor chip name structure
- Structure (Struct) in C programming
- Learn about URLs
May be interested
- Graph data structure (Graph)a graph (graph) is a form of visual representation of a set of objects in which pairs of objects are connected by links. interconnected objects are represented by points called vertices, and links that connect vertices are called edges.
- IBM announces next generation Z processor: 7nm Telum chip, 22.5 billion transistors, 8 cores running on 5GHz clockibm has just released relatively detailed information about its next-generation telum chipset, which is part of the new z series of processors. the telum chip carries a completely new core architecture design, aimed at radically enhancing ai processing capabilities.
- Hash Table data structurethe hash table data structure is a data structure that stores data in a federated manner. in hash table, data is stored in array format, in which data values have their own index values. accessing data becomes faster if we know the index of the data to find.
- Falling money from the sky is real: A $ 700 billion gold meteorite is flying 750 million kilometers from Earth.this meteorite is called psyche-16, made of solid gold worth up to $ 700 billion, or $ 700 billion.
- Infinix HOT 50 Pro+Series: Ultra-thin curved screen phone, durable for 5 years for just under 5 million VNDhot 50 pro+ affirms to be thinner and stronger with an ultra-thin design, titanwing structure of only 6.8mm and the new helio g100 chip with an impressive 5-year durability in the mid-range segment.
- What is Data Structure?data structure is a way of storing, organized and systematic data organization so that data can be used effectively.
- Structure (Struct) in C #in c #, a structure is a data type. it helps you create a single variable that keeps relevant data of diverse data types. the keyword struct in c # is used to create a structure.
- Intel launches a new AI chip that is 1,000 times faster than CPUintel has introduced a new neuronorphic system (neuromorphic) code-named pohoiki beach, made up of 64 chips and 8 million digital neurons.
- Search algorithm by widththe breadth search algorithm (breadth first search - bfs for short) walks through a wide graph and uses a queue to memorize adjacent vertices to start the search when no peak is found. adjacent in any loop.
- Array data structurearray (array) is one of the oldest and most important data structures. arrays can store some fixed elements and these elements have the same type. most data structures use arrays to implement algorithms. here are the important concepts related to arrays.